Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Chou, T. & Orlandi, C. (2015). The Simplest Protocol for Oblivious Transfer. http://eprint.iacr.org/2015/267

Damgård, I. B. & Nielsen, J. B. (2014). Adaptive versus static security in the UC Model. In S. S. M. Chow , J. K. Liu, L. C. K. Hui & S. M. Yiu (Eds.), Provable Security: 8th International Conference, ProvSec 2014, Hong Kong, China, October 9-10, 2014. Proceedings (pp. 10-28). Springer VS. https://doi.org/10.1007/978-3-319-12475-9_2

Damgård, I. B., Lauritsen, R. & Toft, T. (2014). An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation. 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. 398-415 ). Springer. https://doi.org/10.1007/978-3-319-10879-7_23

Aranha, D. F., Fouque, P.-A., Qian, C., Tibouchi, M. & Zapalowicz, J.-C. (2014). Binary Elligator Squared. In A. Joux & A. Youssef (Eds.), Selected Areas in Cryptography -- SAC 2014 Springer. https://doi.org/10.1007/978-3-319-13051-4_2

Damgård, I. B., David, B. M., Giacomelli, I. & Nielsen, J. B. (2014). Compact VSS and Efficient Homomorphic UC Commitments. In P. Sarkar & T. Iwata (Eds.), Advances in Cryptology – ASIACRYPT 2014: 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014, Proceedings, Part II (pp. 213-232 ). Springer VS. https://doi.org/10.1007/978-3-662-45608-8_12

Faust, S., Mukherjee, P., Nielsen, J. B. & Venturi, D. (2014). Continuous Non-malleable Codes. In Y. Lindell (Ed.), Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings (pp. 465-488). Springer. https://doi.org/10.1007/978-3-642-54242-8_20

Frederiksen, T. K., Jakobsen, T. P. & Nielsen, J. B. (2014). Faster Maliciously Secure Two-Party Computation Using the GPU. 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. 358-379 ). Springer. https://doi.org/10.1007/978-3-319-10879-7_21

Oliveira, T., Aranha, D. F., Lopez, J. & Rodriguez-henriquez, F. (2014). Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation. In A. Joux & A. Youssef (Eds.), Selected Areas in Cryptography -- SAC 2014 (pp. 324-344). Springer. https://doi.org/10.1007/978-3-319-13051-4_20

Jakobsen, T. P., Nielsen, J. B. & Orlandi, C. (2014). Framework for Outsourcing of Secure Computation. In G.-J. Ahn , A. Oprea & R. Safavi-Naini (Eds.), Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, CCSW '14 (pp. 81-92 ). Association for Computing Machinery. https://doi.org/10.1145/2664168.2664170

Aranha, D. F., Fouque, P.-A., Gerard, B., Kammerer, J.-G., Tibouchi, M. & Zapalowicz, J.-C. (2014). GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias. In P. Sarkar & T. Iwata (Eds.), Advances in Cryptology – ASIACRYPT 2014 (pp. 262-281). Springer. https://doi.org/10.1007/978-3-662-45611-8_14

Damgård, I. B., Pedersen, T. B. & Salvail, L. (2014). How to re-use a one-time pad safely and almost optimally even if P = NP. Natural Computing, 13(4), 469-486. https://doi.org/10.1007/s11047-014-9454-5

Nielsen, J. B., Venturi, D. & Zottarel, A. (2014). Leakage-resilient signatures with graceful degradation. In H. Krawczyk (Ed.), Public-Key Cryptography – PKC 2014: 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26-28, 2014. Proceedings (pp. 362-379). Springer. https://doi.org/10.1007/978-3-642-54631-0_21

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

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

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

Baum, C., Damgård, I. B. & Orlandi, C. (2014). Publicly Auditable Secure Multi-Party Computation. 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. 175-196 ). Springer VS. https://doi.org/10.1007/978-3-319-10879-7_11

Damgård, I. B., Fehr, S., Salvail, L. & Schaffner, C. (2014). Secure identification and QKD in the bounded-quantum-storage model. Theoretical Computer Science, 560(1), 12-26. https://doi.org/10.1016/j.tcs.2014.09.014

Cascudo Pueyo, I., Damgård, I. B. & Ranellucci, S. (2014). Server-Aided Two-Party Computation with Simultaneous Corruption. (pp. 18). Cryptology ePrint Archive. Report / Cryptology ePrint Archive No. 2014/809 http://eprint.iacr.org/2014/809.pdf

Orlandi, C., Ostrovsky, R., Rao, V., Sahai, A. & Visconti, I. (2014). Statistical Concurrent Non-malleable Zero Knowledge. In Y. Lindell (Ed.), Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014, 2014. Proceedings (pp. 167-191). Springer Publishing Company. https://doi.org/10.1007/978-3-642-54242-8_8

Damgård, I. B., Funder, J., Nielsen, J. B. & Salvail, L. (2014). Superposition attacks on cryptographic protocols. In C. Padró (Ed.), Information Theoretic Security: 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings (pp. 142-161). Springer. https://doi.org/10.1007/978-3-319-04268-8_9

Aranha, D. F., Barreto, P. S. L. M., Longa, P. & Ricardini, J. E. (2014). The Realm of the Pairings. In T. Lange, K. Lauter & P. Lisonek (Eds.), Selected Areas in Cryptography -- SAC 2013 (pp. 3-25). Springer. https://doi.org/10.1007/978-3-662-43414-7_1

Oliveira, T., Lopez, J. & Aranha, D. F. (2014). Two is the fastest prime: lambda coordinates for binary elliptic curves. Journal of Cryptographic Engineering, 4(1), 3-17. https://doi.org/10.1007/s13389-013-0069-z

Dahl, M. & Damgård, I. B. (2014). Universally composable symbolic analysis for two-party protocols based on homomorphic encryption. In P. Q. Nguyen & E. Oswald (Eds.), Advances in Cryptology – EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings (pp. 695-712). Springer VS. https://doi.org/10.1007/978-3-642-55220-5_38

Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2013). Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier. In K. Sako & P. Sarkar (Eds.), Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II (pp. 140-160 ). Springer VS. https://doi.org/10.1007/978-3-642-42045-0_8

Damgård, I. B. & Zakarias, S. (2013). Constant-overhead secure computation of Boolean circuits using preprocessing. In A. Sahai (Ed.), Theory of Cryptography: 10th TCC 2013. Proceedings (pp. 621-641). Springer VS. https://doi.org/10.1007/978-3-642-36594-2_35

Cohen, G., Damgård, I. B., Ishai, Y., Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. D. (2013). Efficient multiparty protocols via log-depth threshold formulae. In R. Canetti & J. A. Garay (Eds.), Advances in Cryptology – CRYPTO 2013: 33rd Annual Conference. Proceedings, Part II (pp. 185-202). Springer VS. https://doi.org/10.1007/978-3-642-40084-1_11

Cohen, G., Damgård, I. B., Ishai, Y., Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. (2013). Efficient Multiparty Protocols via Log-Depth Threshold Formulae Contact Add Comment RSS-Feed. Electronic Colloquium on Computational Complexity, (TR13-107). http://eccc.hpi-web.de/report/2013/107/

Frederiksen, T. K. & Nielsen, J. B. (2013). Fast and maliciously secure two-party computation using the GPU. In Applied Cryptography and Network Security: 11th International Conference, ACNS 2013, Banff, AB, Canada, June 25-28, 2013. Proceeding (pp. 339-356). Springer VS. https://doi.org/10.1007/978-3-642-38980-1_21

Lindell, Y., Nissim, K. & Orlandi, C. (2013). Hiding the Input-Size in Secure Two-Party Computation. In K. Sako & P. Sarkar (Eds.), Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II (Vol. 8197, pp. 421-440). Springer VS. https://doi.org/10.1007/978-3-642-41019-2_6

Aranha, D. F., Fuentes-Castañeda, L., Knapp, E., Menezes, A. & Rodriguez-Henriquez, F. (2013). Implementing Pairings at the 192-Bit Security Level. In M. Abdalla & T. Lange (Eds.), Pairing-Based Cryptography – Pairing 2012 (pp. 177-195). Springer. https://doi.org/10.1007/978-3-642-36334-4_11

Oliveira, T., Lopez, J., Aranha, D. F. & Rodriguez-henriquez, F. (2013). Lambda Coordinates for Binary Elliptic Curves. In G. Bertoni & J.-S. Coron (Eds.), Cryptographic Hardware and Embedded Systems - CHES 2013 (pp. 311-330). Springer. https://doi.org/10.1007/978-3-642-40349-1_18

Hubacek, P., Nielsen, J. B. & Rosen, A. (2013). Limits on the Power of Cryptographic Cheap Talk. In R. Canetti & J. A. Garay (Eds.), Advances in Cryptology – CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I (pp. 277-297 ). Springer VS. https://doi.org/10.1007/978-3-642-40041-4_16

Frederiksen, T. K., Jakobsen, T. P., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2013). MiniLEGO: Efficient secure two-party computation from general assumptions. In T. Johansson & P. Q. Nguyen (Eds.), Advances in Cryptology – EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings (pp. 537-556). Springer VS. https://doi.org/10.1007/978-3-642-38348-9_32

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

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., 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., Faust, S., Mukherjee, P. & Venturi, D. (2013). Tamper Resilient Cryptography Without Self-Destruct. IACR Cryptology ePrint Archive, (2013). http://eprint.iacr.org/2013/124

Troi, A., Jørgensen, B. N., Larsen, E. M., Blaabjerg, F., Mikkelsen, G. L., Slente, H. P., Madsen, H., Østergaard, J., Entwistle, J. M., Nordentoft, N. C., Meibom, P., Jacobsen, R. H., Thorvildsen, S. & Jørgensen, U. (2013). The smart grid research network: Road map for smart grid research, development and demonstration up to 2020. http://orbit.dtu.dk/fedora/objects/orbit:120708/datastreams/file_593c582c-5f51-4d45-adb4-290c796ad776/content

Damgård, I. B. & Scafuro, A. (2013). Unconditionally Secure and Universally Composable Commitments from Physical Assumptions. In K. Sako & P. Sarkar (Eds.), Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II (pp. 100-119 ). Springer VS. https://doi.org/10.1007/978-3-642-42045-0_6

Dahl, M. & Damgård, I. B. (2013). Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption. Cryptology ePrint Archive. http://eprint.iacr.org/2013/296.pdf

Jawurek, M., Kerschbaum, F. & Orlandi, C. (2013). Zero-knowledge using garbled circuits: Or how to prove non-algebraic statements efficiently. In A.-R. Sadeghi , V. Gligor & M. Yung (Eds.), Proceedings of the ACM Conference on Computer and Communications Security, CCS '13 (pp. 955-966). Association for Computing Machinery. https://doi.org/10.1145/2508859.2516662

Dupuis, F., Nielsen, J. B. & Salvail, L. (2012). Actively Secure Two-Party Evaluation of Any Quantum Operation. Lecture Notes in Computer Science, 7417, 794-811. https://doi.org/10.1007/978-3-642-32009-5_46

Nielsen, J. B., Nordholt, P. S., Orlandi, C. & Burra, S. S. (2012). A New Approach to Practical Active-Secure Two-Party Computation. Lecture Notes in Computer Science, 7417, 681-700 . https://doi.org/10.1007/978-3-642-32009-5_40

Asharov, G. & Orlandi, C. (2012). Calling Out Cheaters : Covert Security with Public VerifiabilitySecurity. Lecture Notes in Computer Science, 7658, 681-698 . https://doi.org/10.1007/978-3-642-34961-4_41

Damgård, I. B. & Zakarias, S. N. H. (2012). Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing. Cryptology ePrint Archive. http://eprint.iacr.org/2012/512

Cramer, R., Damgård, I. B., Kiltz, E., Zakarias, S. N. H. & Zottarel, A. (2012). DDH-Like Assumptions Based on Extension Rings. Lecture Notes in Computer Science, 7293, 644-661 . https://doi.org/10.1007/978-3-642-30057-8_38

Hazay, C., Mikkelsen, G. L., Rabin, T. & Toft, T. (2012). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. Lecture Notes in Computer Science, 7178, 313-331. https://doi.org/10.1007/978-3-642-27954-6_20

Mikkelsen, G. L., Keller, M. & Rupp, A. (2012). Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols. Lecture Notes in Computer Science, 7412, 147-166 . https://doi.org/10.1007/978-3-642-32284-6_9

Ateniese, G., Dagdelen, Ö., Damgård, I. B. & Venturi, D. (2012). Entangled Cloud Storage. http://eprint.iacr.org/2012/511

Aranha, D. F., Faz-Hernandez, A., Lopez, J. & Rodriguez-henriquez, F. (2012). Faster Implementation of Scalar Multiplication on Koblitz Curves. In A. Hevia & G. Neven (Eds.), Progress in Cryptology – LATINCRYPT 2012 (pp. 177-193). Springer. https://doi.org/10.1007/978-3-642-33481-8_10

Displaying results 351 to 400 out of 592

8

Revised 02.09.2025

-

Marianne Dammand Iversen