Publications

List of publications

Sort by: Date | Author | Title

Keller, M. (2012). Theory and practice of cryptographic protocols -or- cryptography: will it blend? Department of Computer Science, Aarhus University.

Damgård, I. B. & López-Alt, A. (2012). Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions. Lecture Notes in Computer Science, 7485, 38-56 . https://doi.org/10.1007/978-3-642-32928-9_3

Nielsen, J. B., Nordholt, P. S., Orlandi, C. & Burra, S. S. (2011). A New Approach to Practical Active-Secure Two-Party Computation. http://eprint.iacr.org/2011/091

Backes, M., Goldberg, I., Kate, A. & Toft, T. (2011). Adding Query Privacy to Robust DHTs. http://arxiv.org/abs/1107.1072

Backes, M., Kate, A. & Patra, A. (2011). Computational Verifiable Secret Sharing Revisited. In D. H. Lee & X. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2011: 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings (pp. 590-609). Springer. Lecture Notes in Computer Science Vol. 7073 https://doi.org/10.1007/978-3-642-25385-0_32

Cramer, R., Damgård, I. B., Kiltz, E., Zakarias, S. N. H. & Zottarel, A. (2011). DDH-like Assumptions Based on Extension Rings. http://eprint.iacr.org/2011/280

Hazay, C., Mikkelsen, G. L., Rabin, T. & Toft, T. (2011). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. http://eprint.iacr.org/2011/494

Aranha, D. F., Karabina, K., Longa, P., Gebotys, C. H. & Lopez, J. (2011). Faster Explicit Formulas for Computing Pairings over Ordinary Curves. In K. G. Paterson (Ed.), Advances in Cryptology – EUROCRYPT 2011 (pp. 48-68). Springer. Lecture Notes in Computer Science Vol. 6623 https://doi.org/10.1007/978-3-642-20465-4_5

Lunemann, C. & Nielsen, J. B. (2011). Fully simulatable quantum-secure coin-flipping and applications. Lecture Notes in Computer Science, 6737, 21-40. https://doi.org/10.1007/978-3-642-21969-6_2

Orlandi, C. (2011). Is Multiparty Computation Any Good In Practice? I E E E International Conference on Acoustics, Speech and Signal Processing. Proceedings, 5848-5851. https://doi.org/10.1109/ICASSP.2011.5947691

Bendlin, R., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2011). Lower and Upper Bounds for Deniable Public-Key Encryption. Lecture Notes in Computer Science, 7073, 125-142. https://doi.org/10.1007/978-3-642-25385-0_7

Damgård, I. B., Pastro, V., Smart, N. & Zakarias, S. N. H. (2011). Multiparty Computation from Somewhat Homomorphic Encryption. http://eprint.iacr.org/2011/535

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

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

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

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

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. Lecture Notes in Computer Science Vol. 7089 https://doi.org/10.1007/978-3-642-25516-8_17

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. (2011). Quantum Communication Attacks on Classical Cryptographic Protocols. Abstract from 5th International Conference on Information Theoretic Security, Amsterdam, Netherlands. https://doi.org/10.1007/978-3-642-20728-0_16

Orlandi, C. (2011). Secure Computation in Untrusted Environments. Department of Computer Science, Aarhus University.

Damgård, I. B., Faust, S. & Hazay, C. (2011). Secure Two-Party Computation with Low Communication. http://eprint.iacr.org/2011/508

Toft, T. (2011). Secure data structures based on multi-party computation. In Proceedings of the 30th Annual ACM SIGACT-SIGOPS ACM Symposium on Principles of Distributed Computing, PODC 2011 (pp. 291-292). Association for Computing Machinery. https://doi.org/10.1145/1993806.1993859

Choudhury, A., Patra, A., Ashwinkumar, B. V., Srinathan, K. & Pandu Rangan, C. (2011). Secure message transmission in asynchronous networks. Journal of Parallel and Distributed Computing, 71(8), 1067-1074. https://doi.org/10.1016/j.jpdc.2011.03.004

Oliveira, L. B., Kansal, A., Gouvea, C. P. L., Aranha, D. F., Lopez, J., Priyantha, B., Goraczko, M. & Zhao, F. (2011). Secure-TWS: Authenticating Node to Multi-user Communication in Shared Sensor Networks. The Computer Journal, 55(4), 384-396. https://doi.org/10.1093/comjnl/bxr089

Bendlin, R., Damgård, I. B., Orlandi, C. & Zakarias, S. N. H. (2011). Semi-Homomorphic Encryption and Multiparty Computation. Lecture Notes in Computer Science, 6632, 169-188. https://doi.org/10.1007/978-3-642-20465-4_11

Taverne, J., Faz-Hernandez, A., Aranha, D. F., Rodriguez-henriquez, F., Hankerson, D. & Lopez, J. (2011). Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication. In B. Preneel & T. Takagi (Eds.), Cryptographic Hardware and Embedded Systems – CHES 2011 (pp. 108-123). Springer. Lecture Notes in Computer Science Vol. 6917 https://doi.org/10.1007/978-3-642-23951-9_8

Taverne, J., Faz-Hernandez, A., Aranha, D. F., Rodriguez-henriquez, F., Hankerson, D. & Lopez, J. (2011). Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. Journal of Cryptographic Engineering, 1, 187-199. https://doi.org/10.1007/s13389-011-0017-8

Toft, T. (2011). Sub-linear, Secure Comparison With Two Non-Colluding Parties. Lecture Notes in Computer Science, 6571, 174-191. https://doi.org/10.1007/978-3-642-19379-8_11

Damgård, I. B., Funder, J. L., Nielsen, J. B. & Salvail, L. (2011). Superposition Attacks on Cryptographic Protocols. http://arxiv.org/abs/1108.6313v1

Damgård, I. B., Jurik, M. J. & Nielsen, J. B. (2010). A generalization of Paillier's public-key system with applications to electronic voting. International Journal of Information Security, 9(6), 371-385. https://doi.org/10.1007/s10207-010-0119-9

Hazay, C. & Toft, T. (2010). Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. Lecture Notes in Computer Science, 6477, 195-212. https://doi.org/10.1007/978-3-642-17373-8_12

Aranha, D. F., Lopez, J. & Hankerson, D. (2010). Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets. In M. Abdalla & P. S. L. M. Barreto (Eds.), Progress in Cryptology – LATINCRYPT 2010 (pp. 144-161). Springer. Lecture Notes in Computer Science Vol. 6212 https://doi.org/10.1007/978-3-642-14712-8_9

Aranha, D. F., Dahab, R., Lopez, J. & Oliveira, L. B. (2010). Efficient implementation of elliptic curve cryptography in wireless sensors. Advances in Mathematics of Communications, 4(2), 169-187. https://doi.org/10.3934/amc.2010.4.169

Damgård, I. B. & Mikkelsen, G. L. (2010). Efficient, Robust and Constant-Round Distributed RSA Key Generation. Lecture Notes in Computer Science, 5978, 183-200. https://doi.org/10.1007/978-3-642-11799-2_12

Damgård, I. B., Geisler, M. & Nielsen, J. B. (2010). From Passive to Covert Security at Low Cost. Lecture Notes in Computer Science, 5978, 128-145. https://doi.org/10.1007/978-3-642-11799-2_9

Aranha, D. F., Lopez, J. & Hankerson, D. (2010). High-Speed Parallel Software Implementation of the ηT Pairing. In J. Pieprzyk (Ed.), Topics in Cryptology - CT-RSA 2010 (pp. 89-105). Springer. Lecture Notes in Computer Science Vol. 5985 https://doi.org/10.1007/978-3-642-11925-5_7

Reistad, T. & Toft, T. (2010). Linear, Constant-rounds Bit-decomposition. Lecture Notes in Computer Science, 5984, 245-257. https://doi.org/10.1007/978-3-642-14423-3_17

Damgård, I. B. & Orlandi, C. (2010). Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost. Lecture Notes in Computer Science, 6223, 558-576. https://doi.org/10.1007/978-3-642-14623-7_30

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

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., 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. & Keller, M. (2010). Secure Multiparty AES. Lecture Notes in Computer Science, 6052, 367-374. https://doi.org/10.1007/978-3-642-14577-3_31

Dupuis, F., Nielsen, J. B. & Salvail, L. (2010). Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries. Lecture Notes in Computer Science, 6223, 685-706. https://doi.org/10.1007/978-3-642-14623-7_37

Bendlin, R. & Damgård, I. B. (2010). Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems. Lecture Notes in Computer Science, 5978, 201-218. https://doi.org/10.1007/978-3-642-11799-2_13

Oliveira, L. B., Aranha, D. F., Gouvea, C. P. L., Scott, M., Camara, D. F., Lopez, J. & Dahab, R. (2010). TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks. Computer Communications, 34(3), 485-493. https://doi.org/10.1016/j.comcom.2010.05.013

Damgård, I. B., Krøigaard, M. & Geisler, M. (2009). A correction to 'efficient and secure comparison for on-line auctions'. International Journal of Applied Cryptography, 1(4), 323-324. https://doi.org/10.1504/IJACT.2009.028031

Damgård, I. B., Geisler, M., Krøigaard, M. & Nielsen, J. B. (2009). Asynchronous Multiparty Computation: Theory and Implementation. Lecture Notes in Computer Science, 5443, 160-179. https://doi.org/10.1007/978-3-642-00468-1_10

Toft, T. (2009). Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values. Lecture Notes in Computer Science, 357-371. https://doi.org/10.1007/978-3-642-00862-7_24

Damgård, I. B., Nielsen, J. B. & Orlandi, C. (2009). Essentially Optimal Universally Composable Oblivious Transfer. Lecture Notes in Computer Science, 5461, 1-14. https://doi.org/10.1007/978-3-642-00730-9

Damgård, I. B., Fehr, S., Lunemann, C., Salvail, L. & Schaffner, C. (2009). Improving the Security of Quantum Protocols via Commit-and-Open. Lecture Notes in Computer Science, 408-427. https://doi.org/10.1007/978-3-642-03356-8_24

Displaying results 401 to 450 out of 606

Revised 12.05.2023

Marianne Dammand Iversen