Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Damgård, I. B., Pedersen, T. P. & Pfitzmann, B. (1997). On the existence of statistically hiding bit commitment schemes and fail-stop signatures. Journal of Cryptology, 10(3), 163-194. https://doi.org/10.1007/s001459900026

Damgård, I. B. (1989). On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs. In G. Brassard (Ed.), Advances in Cryptology - CRYPTO' 89 Proceedings (pp. 17-27). Springer. https://doi.org/10.1007/0-387-34805-0_3

Cramer, R., Damgård, I. B. & Fehr, S. (2001). On the Cost of Reconstructing a Secret or VSS with Optimal Reconstruction. In J. Killian (Ed.), Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 Proceedings (pp. 503-524). Springer. https://doi.org/10.1007/3-540-44647-8_30

Nielsen, J. B., Venturi, D. & Zottarel, A. (2013). On the Connection between Leakage Tolerance and Adaptive Security. In K. Kurosawa & G. Hanaoka (Eds.), Public-Key Cryptography – PKC 2013: 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26 – March 1, 2013. Proceedings (pp. 497-515 ). Springer VS. https://doi.org/10.1007/978-3-642-36362-7_30

Nielsen, J. B. & Ranellucci, S. (2016). On the Computational Overhead of MPC with Dishonest Majority. http://eprint.iacr.org/2016/643

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. https://doi.org/10.1007/978-3-662-54388-7_13

Cramer, R., Damgård, I. B. & Dziembowski, S. (2000). On the complexity of verifiable secret sharing and multiparty computation. In Proceedings of the thirty-second annual ACM symposium on Theory of computing (pp. 325-334). Association for Computing Machinery. https://doi.org/10.1145/335305.335343

Trifiletti, R., Nielsen, J. B., Frederiksen, T. K. & Jakobsen, T. P. (2016). On the Complexity of Additively Homomorphic UC Commitments. In E. Kushilevitz & T. Malkin (Eds.), Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings (Vol. 9562, pp. 542-565). Springer VS. https://doi.org/10.1007/978-3-662-49096-9

Damgård, I. B., Nielsen, J. B., Polychroniadou, A. & Raskin, M. (2016). On the Communication Required for Unconditionally Secure Multiplication. In Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings (Vol. 9815, pp. 459-488). Springer VS. https://doi.org/10.1007/978-3-662-53008-5_16

Hubacek, P. & Wichs, D. (2015). On the Communication Complexity of Secure Function Evaluation with Long Output. In T. Roughgarden (Ed.), Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS '15 (pp. 163-172 ). Association for Computing Machinery. https://doi.org/10.1145/2688073.2688105

Polychroniadou, A., Damgård, I. B., Garg, S., Mukherjee, P., Nielsen, J. B. & Pandey, O. (2016). On the Communication and Round Complexity of Secure Computation. Institut for Datalogi, Aarhus Universitet. http://cs.au.dk/fileadmin/user_upload/IvanFest_AP.pdf

Jakobsen, J. & Orlandi, C. (2015). On the CCA (in)security of MTProto. http://eprint.iacr.org/2015/1177

Jakobsen, J. & Orlandi, C. (2016). On the CCA (in)security of MTProto. In Proceedings of the 6th Workshop on Security and Privacy in Smartphones and Mobile Devices: SPSM '16 (pp. 113-116). Association for Computing Machinery. https://doi.org/10.1145/2994459.2994468

Cramer, R., Damgård, I. B. & Pastro, V. (2011). On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. http://eprint.iacr.org/2011/301

Cramer, R., Damgård, I. B. & Pastro, V. (2012). On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. Lecture Notes in Computer Science, 7412, 62-79 . https://doi.org/10.1007/978-3-642-32284-6_4

Damgård, I. B. & Cramer, R. (2009). On the Amortized Complexity of Zero-Knowledge Protocols. Lecture Notes in Computer Science, 5677, 177-191. https://doi.org/10.1007/978-3-642-03356-8_11

Cramer, R., Damgård, I. B. & Keller, M. (2014). On the Amortized Complexity of Zero-Knowledge Protocols. Journal of Cryptology, 27(2), 284-316. https://doi.org/10.1007/s00145-013-9145-x

Simkin, M., Siniscalchi, L. & Yakoubov, S. (2022). On Sufficient Oracles for Secure Computation with Identifiable Abort. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 494-515). Springer. https://doi.org/10.1007/978-3-031-14791-3_22

Dahl, M., Ning, C. & Toft, T. (2012). On Secure Two-Party Integer Division. Lecture Notes in Computer Science, 7397, 164-178 . https://doi.org/10.1007/978-3-642-32946-3_13

Fleischhacker, N. & Simkin, M. (2021). On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments. In J. A. Garay (Ed.), Public-Key Cryptography – PKC 2021 : 24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10–13, 2021, Proceedings, Part II (pp. 618-648). Springer. https://doi.org/10.1007/978-3-030-75248-4_22

Ben-Sasson, E., Ben-Tov, I., Damgård, I., Ishai, Y. & Ron-Zewi, N. (2016). On public key encryption from noisy codewords. In Public-Key Cryptography – PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 9615, pp. 417-446). Springer VS. https://doi.org/10.1007/978-3-662-49387-8_16

Nielsen, J. B. (2003). On Protocol Security in the Cryptographic Model. (BRICS Dissertation Series DS-03-8 ed.) Afdeling for Kunsthistorie, Institut for Æstetiske Fag, Aarhus Universitet.

Ishai, Y., Kumarasubramanian, A., Orlandi, C. & Sahai, A. (2011). On Invertible Sampling and Adaptive Security. Lecture Notes in Computer Science, 6477, 466-482. https://doi.org/10.1007/978-3-642-17373-8_27

Brandt, J. & Damgård, I. B. (1993). On generation of probable primes by incremental search. In Advances in cryptology - CRYPTO '92 (pp. 358-370). Springer.

Baum, C. (2016). On Garbling Schemes with and Without Privacy. In V. Zikas & R. De Prisco (Eds.), Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings: International Conference on Security and Cryptography for Networks (Vol. 9841, pp. 468-485). Springer VS. https://doi.org/10.1007/978-3-319-44618-9

Pagter, J. I. (2005). On Ajtai’s Lower Bound Technique for R-way Branching Programs and the Hamming Distance Problem. Chicago Journal of Theoretical Computer Science.

Canetti, R., Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2001). On Adaptive vs. Non-adaptive Security of Multiparty Protocols. 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. 262-279). Springer. https://doi.org/10.1007/3-540-44987-6_17

Boschini, C., Damgård, I. & Orlandi, C. (2022). On Access Control Encryption Without Sanitization. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks. SCN 2022 (pp. 220-243). Springer. https://doi.org/10.1007/978-3-031-14791-3_10

melo, A. C. M. A., Silva, N. S. B., Mendes, H. C. & Aranha, D. F. (2006). Obtaining possible execution histories on multiple memory consistency models. In XXV International Conference of the Chilean Computer Science Society (SCCC'05) IEEE. https://doi.org/10.1109/SCCC.2005.1587870

Cascudo, I., Damgård, I., Lacerda, F. & Ranellucci, S. (2016). Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement. In Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings (Vol. 9985, pp. 204-234). Springer VS. https://doi.org/10.1007/978-3-662-53641-4_9

Damgård, I. B., Fehr, S., Salvail, L. & Schaffner, C. (2006). Oblivious Transfer and Linear Functions. In C. Dwork (Ed.), Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006. Proceedings (pp. 427-444). Springer. https://doi.org/10.1007/11818175_26

Abram, D., Damgård, I., Scholl, P. & Trieflinger, S. (2021). Oblivious TLS via Multi-party Computation. In K. G. Paterson (Ed.), Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings (pp. 51-74). Springer. https://doi.org/10.1007/978-3-030-75539-3_3

Marcedone , A. & Orlandi, C. (2014). Obfuscation ⇒ (IND-CPA Security ⇏ Circular Security). In M. Abdalla & R. D. Prisco (Eds.), Security and Cryptography for Networks: 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings (pp. 77-90). Springer VS. https://doi.org/10.1007/978-3-319-10879-7_5

Brian, G., Faonio, A., Obremski, M., Simkin, M. & Venturi, D. (2020). Non-malleable secret sharing against bounded joint-tampering attacks in the plain model. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 127-155). Springer. https://doi.org/10.1007/978-3-030-56877-1_5

Faonio, A. & Nielsen, J. B. (2017). Non-malleable Codes with Split-State Refresh. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (pp. 279-309). Springer VS. https://doi.org/10.1007/978-3-662-54365-8_12

Damgård, I. B., Nicolosi, A. & Fazio, N. (2006). Non-interactive Zero-Knowledge from Homomorphic Encryption. In S. Halevi & T. Rabin (Eds.), Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings (pp. 41-59). Springer. https://doi.org/10.1007/11681878_3

Bai, G., Damgård, I., Orlandi, C. & Xia, Y. (2016). Non-Interactive Verifiable Secret Sharing for Monotone Circuits. In D. Pointcheval, A. Nitaj & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2016 - 8th International Conference on Cryptology in Africa, Proceedings (Vol. 9646, pp. 225-244). Springer VS. https://doi.org/10.1007/978-3-319-31517-1_12

Damgård, I. B. & Thorbek, R. (2007). Non-interactive Proofs for Integer Multiplication. In M. Naor (Ed.), Advances in Cryptology - EUROCRYPT 2007: 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007. Proceedings (pp. 412-429). Springer. https://doi.org/10.1007/978-3-540-72540-4_24

V. L. Pereira, H. & Aranha, D. F. (2017). Non-interactive Privacy-preserving k-NN Classifier. 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. 362-371) https://doi.org/10.5220/0006187703620371

Damgård, I. B. (1993). Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Preprocessing. In R. A. Rueppel (Ed.), Advances in Cryptology - EUROCRYPT' 92: Workshop on the Theory and Application of Cryptographic Techniques Balatonfüred, Hungary, May 24-28, 1992 Proceedings (pp. 341-355). Springer. https://doi.org/10.1007/3-540-47555-9_28

Damgård, I. B. & Groth, J. (2003). Non-interactive and Reusable Non-malleable Commitment Schemes. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (pp. 426-437). Association for Computing Machinery. https://doi.org/10.1145/780542.780605

Nielsen, J. B. (2001). Non-Committing Encryption is Too Easy in the Random Oracle Model. B R I C S Report Series, (RS-01-47).

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. Article 8636460. https://doi.org/10.1109/MSEC.2018.2875324

Ganesh, C., Khoshakhlagh, H. & Parisella, R. (2022). NIWI and New Notions of Extraction for Algebraic Languages. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks. SCN 2022 (pp. 687-710). Springer. https://doi.org/10.1007/978-3-031-14791-3_30

Damgård, I. B., Escudero Ospina, D. E., Frederiksen, T. K., Keller, M., Scholl, P. & Volgushev, N. (2019). New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. In Proceedings - 2019 IEEE Symposium on Security and Privacy, SP 2019 (pp. 1102-1120). Article 8835310 IEEE. https://doi.org/10.1109/SP.2019.00078

Cramer, R. & Damgård, I. B. (1996). New Generation of Secure and Practical RSA-Based Signatures. In N. Koblitz (Ed.), Advances in Cryptology - CRYPTO '96: 16th Annual International Cryptology Conference Santa Barbara, California, USA August 18-22, 1996 Proceedings (pp. 173-185). Springer. https://doi.org/10.1007/3-540-68697-5_14

Funder, J. L. (2011). New entropic uncertainty relations for prime power dimensions. http://arxiv.org/abs/1109.6757

Damgård, I. B. & Pedersen, T. P. (1996). New Convertible Undeniable Signature Schemes. In U. Maurer (Ed.), Advances in Cryptology - EUROCRYPT '96: International Conference on the Theory and Application of Cryptographic Techniques Saragossa, Spain, May 12-16, 1996 Proceedings (pp. 372-386). Springer. https://doi.org/10.1007/3-540-68339-9_32

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

Nordholt, P. S. (2013). New Approaches to Practical Secure Two-Party Computation. Institut for Datalogi, Aarhus Universitet.

Displaying results 251 to 300 out of 617

6

Revised 02.06.2023

-

Marianne Dammand Iversen