Publications

List of publications

Sort by: Date | Author | Title

Dalskov, A. P. K. & Orlandi, C. (2018). Can You Trust Your Encrypted Cloud?: An Assessment of SpiderOakONE's Security. In J. Kim, G-J. Ahn & S. Kim (Eds.), ASIACCS 2018 - Proceedings of the 2018 ACM Asia Conference on Computer and Communications Security (pp. 343-355). Association for Computing Machinery. ASIACCS '18 https://doi.org/10.1145/3196494.3196547

Ciampi, M. & Orlandi, C. (2018). Combining Private Set-Intersection with Secure Two-Party Computation. In D. Catalano & R. De Prisco (Eds.), Security and Cryptography for Networks (Vol. 11035, pp. 464-482). Springer VS. Lecture Notes in Computer Science (LNCS) No. 11035 https://doi.org/10.1007/978-3-319-98113-0

Damgård, I., Luo, J., Oechsner, S., Scholl, P. & Simkin, M. (2018). Compact Zero-Knowledge Proofs of Small Hamming Weight. In M. Abdalla & R. Dahab (Eds.), Public-Key Cryptography - PKC 2018 (Vol. 10770, pp. 530-560). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10770 https://doi.org/10.1007/978-3-319-76581-5_18

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P. (2018). Computer-Aided Proofs for Multiparty Computation with Active Security. In 2018 IEEE 31st Computer Security Foundations Symposium (CSF) (Vol. 2018, pp. 119-131). IEEE. Proceedings of the IEEE Computer Security Foundations Symposium No. 31 https://doi.org/10.1109/CSF.2018.00016

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P-Y. (2018, Jun 19). Computer-aided proofs for multiparty computation with active security. arXiv.org. Computer Security Foundations https://arxiv.org/abs/1806.07197

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). In T. Peyrin & S. Galbraith (Eds.), Advances in Cryptology – ASIACRYPT 2018 (Vol. 11274, pp. 86-117). Springer VS. Lecture Notes in Computer Science (LNCS) No. 11274 https://doi.org/10.1007/978-3-030-03332-3_4

Damgård, I., Kazana, T., Obremski, M., Raj, V. & Siniscalchi, L. (2018). Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. In A. Beimel & S. Dziembowski (Eds.), Theory of Cryptography (Vol. 11240, pp. 225-254). Springer VS. Lecture Notes in Computer Science (LNCS) No. 11240 https://doi.org/10.1007/978-3-030-03810-6_9

Faonio, A., Nielsen, J. B., Simkin, M. & Venturi, D. (2018). Continuously Non-malleable Codes with Split-State Refresh. In B. Preneel & F. Vercauteren (Eds.), Applied Cryptography and Network Security (Vol. 10892, pp. 121-139). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10892 https://doi.org/10.1007/978-3-319-93387-0_7

Fleischhacker, N., Krupp, J., Malavolta, G., Schneider, J., Schröder, D. & Simkin, M. (2018). Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys. IET Information Security, 12(3), 166-183. https://doi.org/10.1049/iet-ifs.2017.0041

Scholl, P. (2018). Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs. In M. Abdalla & R. Dahab (Eds.), Public-Key Cryptography - PKC 2018 (Vol. 10769, pp. 554-583). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10769 https://doi.org/10.1007/978-3-319-76578-5_19

Davi Resende, A. C. & Aranha, D. F. (2018). Faster Unbalanced Private Set Intersection. In S. Meiklejohn & K. Sako (Eds.), Financial Cryptography and Data Security: 22nd International Conference, FC 2018, Nieuwpoort, Curaçao, February 26 – March 2, 2018, Revised Selected Papers (1 ed.). Springer. Security and Cryptology Vol. 10957 https://doi.org/10.1007/978-3-662-58387-6

Velasquez, K., Perez Abreu, D., Assis, M. R. M., Senna, C., Aranha, D. F., Bittencourt, L. F., Laranjeiro, N., Curado, M., Vieira, M., Monteiro, E. & Madeira, E. (2018). Fog orchestration for the Internet of Everything: state-of-the-art and research challenges. Journal of Internet Services and Applications, 9(14). https://doi.org/10.1186/s13174-018-0086-3

Nordholt, P. S. & Veeningen, M. (2018). Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification. In Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Proceedings (pp. 321-339). Lecture Notes in Computer Science Vol. 10892 https://eprint.iacr.org/2018/474.pdf

Baum, C., Damgård, I., Lyubashevsky, V., Oechsner, S. & Peikert, C. (2018). More Efficient Commitments from Structured Lattice Assumptions. In D. Catalano & R. De Prisco (Eds.), Security and Cryptography for Networks (Vol. 11035, pp. 368-385). Springer VS. Lecture Notes in Computer Science (LNCS) No. 11035 https://doi.org/10.1007/978-3-319-98113-0_20

Matias, P., Y. S. Barbosa, P., N. C. Cardoso, T., Mariano, D. & Aranha, D. F. (2018). NIZKCTF: A Non-Interactive Zero-Knowledge Capture the Flag Platform. IEEE Security & Privacy, 16(6), 42-51. https://doi.org/10.1109/MSEC.2018.2875324

Takahashi, A., Tibouchi, M. & Abe, M. (2018). New Bleichenbacher Records: Fault Attacks on qDSA Signatures. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2018(3), 331-371. https://doi.org/10.13154/tches.v2018.i3.331-371

Baena, J., Cabarcas, D., Escudero, D. E., Khathuria, K. & Verbel, J. (2018). Rank Analysis of Cubic Multivariate Cryptosystems. In T. Lange & R. Steinwandt (Eds.), Post-Quantum Cryptography (Vol. 10786, pp. 355-374). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10786 https://doi.org/10.1007/978-3-319-79063-3_17

Barcellos, M. & Aranha, D. F. (2018). Research in Security and Privacy in Brazil. IEEE Security & Privacy, 16(6), 14-21. https://doi.org/10.1109/MSEC.2018.2874855

Cramer, R., Damgård, I., Escudero, D., Scholl, P. & Xing, C. (2018). SPDΖ₂k: Efficient MPC mod 2^k for Dishonest Majority. In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology - CRYPTO 2018 (Vol. 10992, pp. 769-798). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10992 https://doi.org/10.1007/978-3-319-96881-0_26

Floriano, E., Alchieri, E., Aranha, D. F. & Solis, P. (2018). Security and Privacy in Extensible Distributed Coordination. In 23rd IEEE Symposium on Computers and Communication (ISCC 2018)

Baum, C., Lyubashevsky, V., Groth, J., Bootle, J., Cerulli, A. & del Pino, R. (2018). Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. In CRYPTO 2018: Advances in Cryptology https://doi.org/10.1007/978-3-319-96881-0_23

Aranha, D. F. & van de Graaf, J. (2018). The Good, the Bad, and the Ugly: Two Decades of E-Voting in Brazil. IEEE Security & Privacy, 16(6), 22-30. https://doi.org/10.1109/MSEC.2018.2875318

Oliveira, L. B., Pereira, F. M. Q., Misoczki, R., Aranha, D. F., Borges, F., Nogueira, M., Wangham, M., Wu, M. & Liu, J. (2018). The computer for the 21st century: present security & privacy challenges. Journal of Internet Services and Applications, 9(24). https://doi.org/10.1186/s13174-018-0095-2

Jensen, C. (Ed.), Lind Olsen, E. (Ed.), Mikkelsen, G. L., Syberg , L., Nielsen, L. L., Hansen, M. A. E., Hjortlund, M., Madsen, O. L., Høngaard Andersen, P. & Duvold, T. (2018). The future market for cybersecurity in Denmark.

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). TinyKeys: A New Approach to Efficient Multi-Party Computation. In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology - CRYPTO 2018 (Vol. 10993, pp. 3-33). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10993 https://doi.org/10.1007/978-3-319-96878-0_1

Baum, C., Lin, H. & Oechsner, S. (2018). Towards Practical Lattice-Based One-Time Linkable Ring Signatures. In D. Naccache, S. Xu, S. Qing, P. Samarati, G. Blanc, R. Lu, Z. Zhang & A. Meddahi (Eds.), Information and Communications Security: ICICS 2018 (Vol. 11149, pp. 303-322). Springer VS. Lecture Notes in Computer Science (LNCS) No. 11149 https://doi.org/10.1007/978-3-030-01950-1_18

Pinkas, B., Baum, C., Adi, Y., Keshet, Y. & Cisse, M. (2018). Turning your weakness into a strength: Watermarking deep neural networks by backdooring. In 27th USENIX Security Symposium (USENIX Security 2018) https://arxiv.org/abs/1802.04633

Larsen, K. G. & Nielsen, J. B. (2018). Yes, There is an Oblivious RAM Lower Bound! In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology -- CRYPTO 2018 (pp. 523-542). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10992 https://doi.org/10.1007/978-3-319-96881-0_18

Damgård, I., Orlandi, C. & Simkin, M. (2018). Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology - CRYPTO 2018 (Vol. 10992, pp. 799-829). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10992 https://doi.org/10.1007/978-3-319-96881-0_27

Faz-Hernandez, A., Fujii, H., Aranha, D. F. & Lopez, J. (2017). A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA). In S. S. Ali, J-L. Danger & T. Eisenbarth (Eds.), Security, Privacy, and Applied Cryptography Engineering: 7th International Conference, SPACE 2017, Goa, India, December 13-17, 2017, Proceedings (pp. 170-189). Springer. Lecture Notes in Computer Science Vol. 10662 Security and Cryptology Vol. 10662 https://doi.org/10.1007/978-3-319-71501-8_10

Fuchsbauer, G., Gay, R., Kowalczyk, L. & Orlandi, C. (2017). Access Control Encryption for Equality, Comparison, and More. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II (Vol. 10175, pp. 88-118). Springer VS. Lecture Notes in Computer Science Vol. 10175 https://doi.org/10.1007/978-3-662-54388-7_4

Coron, J-S. & Nielsen, J. B. (Eds.) (2017). Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part I. In J-S. Coron & J. Buus Nielsen (Eds.), Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part I (Vol. 10210). Springer VS. Lecture Notes in Computer Science Vol. 10210 https://doi.org/10.1007/978-3-319-56620-7

Coron, J-S. & Nielsen, J. B. (Eds.) (2017). Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part II. In J-S. Coron & J. Buus Nielsen (Eds.), Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part II (Vol. 10211). Springer VS. Lecture Notes in Computer Science Vol. 10211 https://doi.org/10.1007/978-3-319-56614-6

Coron, J-S. & Nielsen, J. B. (Eds.) (2017). Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part III. In J-S. Coron & J. Buus Nielsen (Eds.), Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part III (Vol. 10212). Springer VS. Lecture Notes in Computer Science Vol. 10212 https://doi.org/10.1007/978-3-319-56617-7

Cramer, R., Damgård, I., Xing, C. & Yuan, C. (2017). Amortized complexity of zero-knowledge proofs revisited: Achieving linear soundness slack. In J-S. Coron & J. Buus Nielsen (Eds.), Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Vol. 10210, pp. 479-500). Springer VS. Lecture Notes in Computer Science Vol. 10210 https://doi.org/10.1007/978-3-319-56620-7_17

Damgård, I., Faust, S., Mukherjee, P. & Venturi, D. (2017). Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier. Journal of Cryptology, 30(1), 152-190. https://doi.org/10.1007/s00145-015-9218-0

Damgård, I., Damgård, K., Nielsen, K., Nordholt, P. S. & Toft, T. (2017). Confidential benchmarking based on multiparty computation. In J. Grossklags & B. Preneel (Eds.), Financial Cryptography and Data Security - 20th International Conference, FC 2016, Revised Selected Papers (Vol. 9603 LNCS, pp. 169-187). Springer VS. Lecture Notes in Computer Science Vol. 9603 https://doi.org/10.1007/978-3-662-54970-4_10

Nielsen, J. B., Schneider, T. & Trifiletti, R. (2017). Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In NDSS ’17 (pp. 1-15). Internet Society. https://doi.org/10.14722/ndss.2017.23075

Fujii, H. & Aranha, D. F. (2017). Curve25519 for the Cortex-M4 and beyond. In 5th International Conference on Cryptology and Information Security in Latin America (LATINCRYPT 2017)

Kolesnikov, V., Nielsen, J. B., Rosulek, M., Trieu, N. & Trifiletti, R. (2017). DUPLO: Unifying Cut-and-Choose for Garbled Circuits. In DUPLO: Unifying Cut-and-Choose for Garbled Circuits (pp. 3-20). Association for Computing Machinery. https://doi.org/10.1145/3133956.3133991

Aranha, D. F., Azarderakhsh, R. & Karabina, K. (2017). Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves. In S. S. Ali, J-L. Danger & T. Eisenbarth (Eds.), Security, Privacy, and Applied Cryptography Engineering: 7th International Conference, SPACE 2017, Goa, India, December 13-17, 2017, Proceedings (pp. 74-92). Springer. Lecture Notes in Computer Science Vol. 10662 Security and Cryptology Vol. 10662 https://doi.org/10.1007/978-3-319-71501-8_5

Orlandi, C. (2017). Faster Zero-Knowledge Protocols and Applications: Invited Talk Abstract. In P. Farshim & E. Simion (Eds.), Innovative Security Solutions for Information Technology and Communications - 10th International Conference,SecITC 2017, Revised Selected Papers: Innovative Security Solutions for Information Technology and Communications (Vol. 10543, pp. 1-11). Springer VS. Lecture Notes in Computer Science Vol. 10543 https://doi.org/10.1007/978-3-319-69284-5_1

Faonio, A. & Nielsen, J. B. (2017). Fully Leakage-Resilient Codes. In S. Fehr (Ed.), Public-Key Cryptography -- PKC 2017 (Vol. 10174, pp. 333-358). Springer VS. Lecture Notes in Computer Science Vol. 10174 https://doi.org/10.1007/978-3-662-54365-8_14

Faonio, A., Nielsen, J. B. & Venturi, D. (2017). Fully Leakage-resilient Signatures Revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model. Theoretical Computer Science, 660(C), 23-56. https://doi.org/10.1016/j.tcs.2016.11.016

Cramer, R., Damgård, I., Döttling, N., Giacomelli, I. & Xing, C. (2017). Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. In J. Shikata (Ed.), Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings (Vol. 10681, pp. 1-25). Springer VS. Lecture Notes in Computer Science Vol. 10681 https://doi.org/10.1007/978-3-319-72089-0_1

Hazay, C., Scholl, P. & Soria-Vazquez, E. (2017). Low cost constant round MPC combining BMR and oblivious transfer. In T. Takagi & T. Peyrin (Eds.), Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (Vol. 10624, pp. 598-628). Springer VS. Lecture Notes in Computer Science Vol. 10624 https://doi.org/10.1007/978-3-319-70694-8_21

Ghosh, S., Nielsen, J. B. & Nilges, T. (2017). Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. In T. Takagi & T. Peyrin (Eds.), Advances in Cryptology -- ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I (Vol. 10624, pp. 629-659). Springer VS. Lecture Notes in Computer Science Vol. 10624 https://doi.org/10.1007/978-3-319-70694-8_22

V. L. Pereira, H. & Aranha, D. F. (2017). Non-interactive Privacy-preserving k-NN Classifier. In P. Mori, S. Furnell & O. Camp (Eds.), Proceedings of the 3rd International Conference on Information Systems Security and Privacy (Vol. 1, pp. 362-371) https://doi.org/10.5220/0006187703620371

Faonio, A. & Nielsen, J. B. (2017). Non-malleable Codes with Split-State Refresh. In S. Fehr (Ed.), Public-Key Cryptography -- PKC 2017 (pp. 279-309). Springer VS. Lecture Notes in Computer Science Vol. 10174 https://doi.org/10.1007/978-3-662-54365-8_12

Nielsen, J. B. & Ranellucci, S. (2017). On the computational overhead of MPC with dishonest majority. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 10175, pp. 369-395). Springer VS. Lecture Notes in Computer Science Vol. 10175 https://doi.org/10.1007/978-3-662-54388-7_13

Displaying results 201 to 250 out of 606

Revised 12.05.2023

Marianne Dammand Iversen