Publications

List of publications

Sort by: Date | Author | Title

Frederiksen, T. K., Nielsen, J. B. & Orlandi, C. (2014). Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge. (pp. 30). Cryptology ePrint Archive. http://eprint.iacr.org/2014/598.pdf

Frederiksen, T. K., Nielsen, J. B. & Orlandi, C. (2015). Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge. In E. Oswald & M. Fischlin (Eds.), Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II (pp. 191-219). Springer VS. https://doi.org/10.1007/978-3-662-46803-6_7

Meiklejohn, S. & Orlandi, C. (2015). Privacy-enhancing overlays in bitcoin. In M. Brenner , N. Christin , B. Johnson & K. Rohloff (Eds.), Financial Cryptography and Data Security : FC 2015 International Workshops, BITCOIN, WAHC, and Wearable, San Juan, Puerto Rico, January 30, 2015, Revised Selected Papers (Vol. 8976, pp. 127-141). Springer. https://doi.org/10.1007/978-3-662-48051-9_10

Miltersen, P. B., Nielsen, J. B. & Triandopoulos, N. (2009). Privacy-Enhancing Auctions Using Rational Cryptography. Lecture Notes in Computer Science, 5677, 541-558. https://doi.org/10.1007/978-3-642-03356-8_32

Nissim, K., Orlandi, C. & Smorodinsky, R. (2012). Privacy-aware mechanism design. In B. Faltings (Ed.), Proceedings of the ACM Conference on Electronic Commerce, EC '12 (pp. 774-789). Association for Computing Machinery. https://doi.org/10.1145/2229012.2229073

Aggarwal, D., Obremski, M., Ribeiro, J., Simkin, M. & Siniscalchi, L. (2022). Privacy Amplification with Tamperable Memory via Non-Malleable Two-Source Extractors. IEEE Transactions on Information Theory, 68(8), 5475-5495. https://doi.org/10.1109/TIT.2022.3167404

Toft, T. (2007). Primitives and Applications for Multi-party Computation. Department of Computer Science, Aarhus University. Daimi PhD Dissertation No. PD-07-7

B. S. Reis, T., Aranha, D. F. & Lopez, J. (2017). PRESENT Runs Fast: Efficient and Secure Implementation in Software. In W. Fischer & N. Homma (Eds.), Cryptographic Hardware and Embedded Systems – CHES 2017 - 19th International Conference, Proceedings: 19th International Conference, Taipei, Taiwan, September 25-28, 2017, Proceedings (pp. 644-664). Springer. https://doi.org/10.1007/978-3-319-66787-4_31

Faonio, A., Nielsen, J. B. & Venturi, D. (2017). Predictable arguments of knowledge. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 10174, pp. 121-150). Springer VS. https://doi.org/10.1007/978-3-662-54365-8_6

Damgård, I. B. & Koprowski, M. (2001). Practical Threshold RSA Signatures Without a Trusted Dealer. In B. Pfitzmann (Ed.), Advances in Cryptology - EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (pp. 152-165). Springer. https://doi.org/10.1007/3-540-44987-6_10

Brassard, G. & Damgård, I. B. (1990). "Practical IP" <- MA. In S. Goldwasser (Ed.), Advances in Cryptology - CRYPTO' 88: Proceedings (pp. 580-582). Springer. https://doi.org/10.1007/0-387-34799-2_42

Damgård, I. B., Keller, M., Larraia , E., Pastro, V., Scholl, P. & Smart, N. P. (2013). Practical Covertly Secure MPC for Dishonest Majority – or: Breaking the SPDZ Limits. In J. Crampton , S. Jajodia & K. Mayes (Eds.), Computer Security – ESORICS 2013: 18th European Symposium on Research in Computer Security, Egham, UK, September 9-13, 2013. Proceedings (pp. 1-18 ). Springer VS. https://doi.org/10.1007/978-3-642-40203-6_1

Damgård, I. B. (1994). Practical and Provably Secure Release of a Secret and Exchange of Signatures. In T. Helleseth (Ed.), Advances in Cryptology - EUROCRYPT '93: Workshop on the Theory and Application of Cryptographic Techniques Lofthus, Norway, May 23-27, 1993 Proceedings (pp. 200-217). Springer. https://doi.org/10.1007/3-540-48285-7_17

Damgård, I. B. (1995). Practical and provably secure release of a secret and exchange of signatures. Journal of Cryptology, 8(4), 201-222. https://doi.org/10.1007/BF00191356

Chase, M., Derler, D., Goldfeder, S., Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D. & Zaverucha, G. (2017). Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1825-1842). Association for Computing Machinery. https://doi.org/10.1145/3133956.3133997

Costa Lopes, A. & Aranha, D. F. (2017). Platform-agnostic Low-intrusion Optical Data Exfiltration. In P. Mori, S. Furnell & O. Camp (Eds.), ICISSP 2017 - Proceedings of the 3rd International Conference on Information Systems Security and Privacy (Vol. 1, pp. 474-480) https://doi.org/10.5220/0006211504740480

Damgård, I., Escudero, D. & Polychroniadou, A. (2023). Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. In K-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 7:1--7:21). Article 7 Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2023.7

Baum, C., Frederiksen, T. K., Hesse, J., Lehmann, A. & Yanai, A. (2020). Pesto: Proactively secure distributed single sign-on, or how to trust a hacked server. In Proceedings - 5th IEEE European Symposium on Security and Privacy, Euro S and P 2020 (pp. 587-606). Article 9230400 IEEE. https://doi.org/10.1109/EuroSP48549.2020.00044

Alves, P., Nayara Ortiz, J. & Aranha, D. F. (2022). Performance of hierarchical transforms in homomorphic encryption: A case study on logistic regression inference. Abstract from 1st Annual FHE.org Conference on Fully Homomorphic Encryption, Trondheim, Norway.

Alves, P., Nayara Ortiz, J. & Aranha, D. F. (2023). Performance of hierarchical transforms in homomorphic encryption: a case study on logistic regression inference. Journal of Cryptographic Engineering, 13(3), 295-310. https://doi.org/10.1007/s13389-023-00325-1

Raskin, M. & Simkin, M. (2019). Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead. In S. D. Galbraith & S. Moriai (Eds.), Advances in Cryptology – ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings: 25th International Conference on the Theory and Application of Cryptology and Information Security Kobe, Japan, December 8–12, 2019 Proceedings (Vol. II, pp. 537-563). Springer. https://doi.org/10.1007/978-3-030-34621-8_19

Damgård, I. B., Meldgaard, S. T. & Nielsen, J. B. (2011). Perfectly Secure Oblivious RAM without Random Oracles. Lecture Notes in Computer Science, 6597, 144-163. https://doi.org/10.1007/978-3-642-19571-6_10

Damgård, I. B., Ishai, Y. & Krøigaard, M. (2010). Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. Lecture Notes in Computer Science, 6110, 445-465. https://doi.org/10.1007/978-3-642-13190-5_23

Damgård, I. B. & Nielsen, J. B. (2001). Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. B R I C S Report Series, (RS-01-41).

Damgård, I. B. & Nielsen, J. B. (2002). Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. In M. Yung (Ed.), Advances in Cryptology - CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18-22, 2002 Proceedings (pp. 581-596). Springer. https://doi.org/10.1007/3-540-45708-9_37

Damgård, I. B. (1988). Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals. In S. Goldwasser (Ed.), Advances in Cryptology - CRYPTO' 88: Proceedings (pp. 328-335). Springer. https://doi.org/10.1007/0-387-34799-2_26

Schwartzbach, N. I. (2022). Payment Schemes from Limited Information with Applications in Distributed Computing. In EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation (pp. 129-149) https://doi.org/10.1145/3490486.3538342

Aranha, D. F., Knapp, E., Menezes, A. & Rodriguez-henriquez, F. (2011). Parallelizing the Weil and Tate Pairings. In L. Chen (Ed.), Cryptography and Coding (pp. 275-295). Springer. https://doi.org/10.1007/978-3-642-25516-8_17

Chen, L., Damgård, I. B. & Pedersen, T. P. (1995). Parallel divertibility of proofs of knowledge (Extended abstract). In A. De Santis (Ed.), Advances in Cryptology - EUROCRYPT'94: Workshop on the Theory and Application of Cryptographic Techniques Perugia, Italy, May 9-12, 1994 Proceedings (pp. 140-155). Springer. https://doi.org/10.1007/BFb0053431

Baum, C., David, B. & Frederiksen, T. K. (2021). P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange. In K. Sako & N. O. Tippenhauer (Eds.), Applied Cryptography and Network Security - 19th International Conference, ACNS 2021, Proceedings (pp. 163-194). Springer. https://doi.org/10.1007/978-3-030-78372-3_7

Harnik, D., Ishai, Y., Kushilevitz, E. & Nielsen, J. B. (2008). OT-Combiners Via Secure Computation. Lecture Notes in Computer Science, 4948, 393-411. https://doi.org/10.1007/978-3-540-78524-8_22

Guimaraes, A., Aranha, D. F. & Borin, E. (2019). Optimized implementation of QC‐MDPC code‐based cryptography. Concurrency and Computation: Practice & Experience, 31(18), Article e5089. https://doi.org/10.1002/cpe.5089

Brandt, M., Orlandi, C., Shrishak, K. & Shulman, H. (2020). Optimal Transport Layer for Secure Computation. In P. Samarati, S. D. C. D. Vimercati, M. S. Obaidat & J. Ben-Othman (Eds.), ICETE 2020 - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications (Vol. Volume 3: SECRYPT, pp. 130-141). SCITEPRESS Digital Library. https://doi.org/10.5220/0009826801300141

Pagter, J. I. & Rauhe, T. (1998). Optimal Time-Space Trade-Offs for Sorting. In Proc. of 39th Annual Symposium on Foundations of Computer Science (FOCS '98) IEEE. https://doi.org/10.1109/SFCS.1998.743455

Pagh, R. & Pagter, J. (2001). Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting. B R I C S Report Series, (RS-01-2), 20-20.

Pagh, R., Pagter, J. I. & Eppstein, D. (Ed.) (2002). Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting. In Symposium on Discrete Algorithm: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (pp. 9-18). Association for Computing Machinery.

Jafargholi, Z., Larsen, K. G. & Simkin, M. (2021). Optimal oblivious priority queues. In D. Marx (Ed.), ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 (pp. 2366-2383). Association for Computing Machinery.

Aranha, D. F., Beuchat, J-L., Detrey, J. & Estibals, N. (2012). Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves. In O. Dunkelman (Ed.), Topics in Cryptology – CT-RSA 2012 (pp. 98-115). Springer. https://doi.org/10.1007/978-3-642-27954-6_7

Orlandi, C., Ravi, D. & Scholl, P. (2022). On the Bottleneck Complexity of MPC with Correlated Randomness. In G. Hanaoka, J. Shikata & Y. Watanabe (Eds.), Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I (pp. 194-220). Springer. https://doi.org/10.1007/978-3-030-97121-2_8

Damgård, I. B. & Mikkelsen, G. L. (2009). On the Theory and Practice of Personal Digital Signatures. Lecture Notes in Computer Science, 277-296. https://doi.org/10.1007/978-3-642-00468-1

Beerliová-Trubíniová, Z., Hirt, M. & Nielsen, J. B. (2010). On the theoretical gap between synchronous and asynchronous MPC protocols. In A. Richa & R. Guerraoui (Eds.), Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing. PODC '10 (pp. 211-218). Association for Computing Machinery. https://doi.org/10.1145/1835698.1835746

Damgård, I. B. (1988). On The Randomness of Legendre and Jacobi Sequences. In S. Goldwasser (Ed.), Advances in Cryptology - CRYPTO' 88: Proceedings (pp. 163-172). Springer. https://doi.org/10.1007/0-387-34799-2_13

Mikkelsen, G. L. (2011). On the Protection of Digital Identities Through Threshold Cryptography. Department of Computer Science, Aarhus University.

Ishai, Y., Kushilevitz, E., Meldgaard, S. T., Orlandi, C. & Paskin-Cherniavsky, A. (2013). On the Power of Correlated Randomness in Secure Computation. In A. Sahai (Ed.), Theory of Cryptography: 10th TCC 2013. Proceedings (pp. 600-620 ). Springer VS. https://doi.org/10.1007/978-3-642-36594-2_34

Damgård, I. B., Dupont-Dupuis, F. & Nielsen, J. B. (2015). On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation. In Information Theoretic Security: 8th International Conference, ICITS 2015, Lugano, Switzerland, May 2-5, 2015. Proceedings (pp. 87-104). Springer VS. https://doi.org/10.1007/978-3-319-17470-9_6

Fitzi, M. & Nielsen, J. B. (2009). On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. Lecture Notes in Computer Science, 5805, 449-463. https://doi.org/10.1007/978-3-642-04355-0_46

Damgård, I. B., Nielsen, J. B. & Orlandi, C. (2010). On the Necessary and Sufficient Assumptions for UC Computation. Lecture Notes in Computer Science, 5978, 109-127. https://doi.org/10.1007/978-3-642-11799-2_8

Damgård, I. B., Pedersen, T. B. & Salvail, L. (2004). On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-way Quantum Transmission. In C. Cachin & J. Camenisch (Eds.), Advances in Cryptology - EUROCRYPT 2004: International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings (pp. 91-108). Springer. https://doi.org/10.1007/978-3-540-24676-3_6

Damgård, I. B., Killian, J. & Salvail, L. (1999). On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. In J. Stern (Ed.), Advances in Cryptology - EUROCRYPT '99: International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, May 2-6, 1999 Proceedings (pp. 56-73). Springer. https://doi.org/10.1007/3-540-48910-X_5

Damgård, I. B., Pedersen, T. P. & Pfitzmann, B. (1994). On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures. In D. R. Stinson (Ed.), Advances in Cryptology - CRYPTO' 93: 13th Annual International Cryptology Conference Santa Barbara, California, USA August 22-26, 1993 Proceedings (pp. 250-265). Springer. https://doi.org/10.1007/3-540-48329-2_22

Displaying results 201 to 250 out of 617

Revised 02.06.2023

Marianne Dammand Iversen