Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Aranha, D. F., Baum, C., Gjøsteen, K., Silde, T. & Tunge, T. (2021). Lattice-Based Proof of Shuffle and Applications to Electronic Voting. In K. G. Paterson (Ed.), Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings (pp. 227-251). Springer. https://doi.org/10.1007/978-3-030-75539-3_10

Bendlin, R. (2013). Lattice-based Cryptography: Threshold Protocols and Multiparty Computation. Department of Computer Science, Aarhus University.

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

Aranha, D. F., Novaes, F. R., Takahashi, A., Tibouchi, M. & Yarom, Y. (2020). LadderLeak: Breaking ECDSA with Less than One Bit of Nonce Leakage. In CCS 2020 - Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (pp. 225-242). Association for Computing Machinery. https://doi.org/10.1145/3372297.3417268

Aranha, D. F., Lin, C., Orlandi, C. & Simkin, M. (2022). Laconic Private Set-Intersection From Pairings. In CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (pp. 111-124). Association for Computing Machinery. https://doi.org/10.1145/3548606.3560642

Damgård, I. B. & Park, S. (2012). Is Public-Key Encryption Based on LPN Practical? http://eprint.iacr.org/2012/699

Damgård, I. B., Nielsen, J. B. & Wichs, D. (2008). Isolated Proofs of Knowledge and Isolated Zero Knowledge. Lecture Notes in Computer Science, 4965, 509-526. https://doi.org/10.1007/978-3-540-78967-3_29

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

Pagter, J. I. & Arge, L. (2000). I/O-Space Trade-Offs: Extended Abstract. In Algorithm Theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5-7, 2000 Proceedings (pp. 509-514). Springer. https://doi.org/10.1007/3-540-44985-X_38

Guimaraes, A., Borin, E. & Aranha, D. F. (2019). Introducing arithmetic failures to accelerate QC-MDPC code-based cryptography. In M. Baldi, E. Persichetti & P. Santini (Eds.), Code-Based Cryptography - 7th International Workshop, CBC 2019, Revised Selected Papers (pp. 44-68). Springer. https://doi.org/10.1007/978-3-030-25922-8_3

Damgård, I. B. (1994). Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract). 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. 100-109). Springer. https://doi.org/10.1007/3-540-48329-2_9

Baum, C., David, B. & Dowsley, R. (2020). Insured MPC: Efficient Secure Computation with Financial Penalties. In J. Bonneau & N. Heninger (Eds.), Financial Cryptography and Data Security: FC 2020 (pp. 404-420). Springer. https://doi.org/10.1007/978-3-030-51280-4_22

Damgård, I., Escudero, D. & Ravi, D. (2021). Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries. In Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings (pp. 591-622). Springer. https://doi.org/10.1007/978-3-030-90459-3_20

Campanelli, M., Fiore, D., Greco, N., Kolonelos, D. & Nizzardo, L. (2020). Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage. In S. Moriai & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 3-35). Springer. https://doi.org/10.1007/978-3-030-64834-3_1

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

Aranha, D. F., Dalskov, A., Orlandi, C. & Escudero Ospina, D. E. (2021). Improved Threshold Signatures, Proactive Secret Sharing and Input Certification from LSS Isomorphisms. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 (pp. 382-404). Springer. https://doi.org/10.1007/978-3-030-88238-9_19

Escudero, D., Ghosh, S., Keller, M., Rachuri, R. & Scholl, P. (2020). Improved primitives for mpc over mixed arithmetic-binary circuits. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 823-852). Springer. https://doi.org/10.1007/978-3-030-56880-1_29

Damgård, I. B. & Nielsen, J. B. (2000). Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. In M. Bellare (Ed.), Advances in Cryptology - CRYPTO 2000: 20th Annual International Cryptology Conference Santa Barbara, California, USA, August 20-24, 2000 Proceedings (pp. 432-450). Springer. https://doi.org/10.1007/3-540-44598-6_27

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

Damgård, I. B., Keller, M., Keller, E., Miles, C. & Smart, N. P. (2012). Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol. Lecture Notes in Computer Science, 7485, 241-263. https://doi.org/10.1007/978-3-642-32928-9_14

Ateniese, G., Francati, D., Magri, B. & Venturi, D. (2021). Immunization against complete subversion without random oracles. Theoretical Computer Science, 859, 1-36. https://doi.org/10.1016/j.tcs.2021.01.002

Francati, D., Guidi, A., Russo, L. & Venturi, D. (2021). Identity-Based Matchmaking Encryption without Random Oracles. Abstract from 22nd International Conference on Cryptology in India, Jaipur, India.

Damgård, I. B., Fitzi, M., Nielsen, J. B. & Toft, T. (2005). How to Split a Shared Secret into Shared Bits in Constant-Round. Cryptology ePrint Archive. http://eprint.iacr.org/2005/140.pdf

Bendlin, R., Peikert, C. & Krehbiel, S. (2013). How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE. In 11th International Conference on Applied Cryptography and Network Security, ACNS 2013 (Vol. 7954, pp. 218-236). Springer VS. https://doi.org/10.1007/978-3-642-38980-1_14

Fitzi, M., Nielsen, J. B. & Wolf, S. (2007). How to Share a Key (Invited paper). Paper presented at 45th Annual Allerton Conference on Communication, Control, and Computing, 2007, Urbana-Champaign, United States.

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

Baum, C., Damgård, I. B., Larsen, K. G. & Nielsen, M. (2016). How to prove knowledge of small secrets. In J. Katz & M. Robshaw (Eds.), Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Vol. 9816, pp. 478-498). Springer VS. https://doi.org/10.1007/978-3-662-53015-3_17

Aggarwal, D., Obremski, M., Ribeiro, J., Siniscalchi, L. & Visconti, I. (2020). How to extract useful randomness from unreliable sources. In A. Canteaut & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020 (pp. 343-372). Springer. https://doi.org/10.1007/978-3-030-45721-1_13

Jakobsen, S. K. & Orlandi, C. (2016). How To Bootstrap Anonymous Communication. In ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (pp. 333-344). Association for Computing Machinery. https://doi.org/10.1145/2840728.2840743

Jakobsen, S. K. & Orlandi, C. (2015). How to Bootstrap Anonymous Communication. http://arxiv.org/pdf/1502.05273v1

Jakobsen, S. K. & Orlandi, C. (2015). How to Bootstrap Anonymous Communication. http://eprint.iacr.org/2015/130

Damgård, I. B., Goldreich, O., Okamoto, T. & Wigderson, A. (1995). Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. In D. Coppersmith (Ed.), Advances in Cryptology - CRYPT0' 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27-31, 1995 Proceedings (pp. 325-338). Springer. https://doi.org/10.1007/3-540-44750-4_26

Dalskov, A. P. K. & Escudero Ospina, D. E. (2021). Honest Majority MPC with Abort with Minimal Online Communication. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 - 7th International Conference on Cryptology and Information Security in Latin America, Proceedings: 7th International Conference on Cryptology and Information Security in Latin America, Bogotá, Colombia, October 6–8, 2021, Proceedings (pp. 453-472). Springer. https://doi.org/10.1007/978-3-030-88238-9_22

Boyle, E., Kohl, L. & Scholl, P. (2019). Homomorphic Secret Sharing from Lattices Without FHE. In Y. Ishai & V. Rijmen (Eds.), Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings: EUROCRYPT 2019 (pp. 3-33). Springer VS. https://doi.org/10.1007/978-3-030-17656-3_1

Guimaraes, A., Neumann, L., Andaló, F. A., Aranha, D. F. & Borin, E. (2022). Homomorphic evaluation of large look-up tables for inference on human genome data in the cloud. In Proceedings - 2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing Workshops, SBAC-PADW 2022 (pp. 33-38). IEEE. https://doi.org/10.1109/SBAC-PADW56527.2022.00015

Damgård, I. B., Geisler, M. & Krøigaard, M. (2008). Homomorphic encryption and secure comparison. International Journal of Applied Cryptography, 1(1), 22-31. https://doi.org/10.1504/IJACT.2008.017047

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. https://doi.org/10.1007/978-3-642-11925-5_7

Bogdanov, D., Niitsoo, M., Toft, T. & Willemson, J. (2012). High-performance secure multi-party computation for data mining applications. International Journal of Information Security, 11(6), 403-418 . https://doi.org/10.1007/s10207-012-0177-2

Burra, S. S., Larraia, E., Nielsen, J. B., Nordholt, P. S., Orlandi, C., Orsini, E., Scholl, P. & Smart, N. P. (2015). High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer. http://eprint.iacr.org/2015/472

Burra, S. S., Larraia, E., Nielsen, J. B., Nordholt, P. S., Orlandi, C., Orsini, E., Scholl, P. & Smart, N. P. (2021). High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer. Journal of Cryptology, 34(3), Article 34. https://doi.org/10.1007/s00145-021-09403-1

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from The Coq Workshop 2020. https://coq-workshop.gitlab.io/2020/abstracts/Coq2020_04-02-primes.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from 2nd Workshop on Formal Methods for Blockchains. https://fmbc.gitlab.io/2020/files/FMBC2020.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2023). High-assurance field inversion for curve-based cryptography. In 2023 IEEE 36th Computer Security Foundations Symposium (CSF) (pp. 111-126). IEEE. https://doi.org/10.1109/CSF57540.2023.00008

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

Blundo, C., Cimato, S. & Siniscalchi, L. (2023). Heuristics for constrained role mining in the post-processing framework. Journal of Ambient Intelligence and Humanized Computing, 14(8), 9925-9937. https://doi.org/10.1007/s12652-021-03648-1

Brickell, E. F., Chaum, D., Damgård, I. B. & van der Graaf, J. (1987). Gradual and Verifiable Release of a Secret (Extended Abstract). In C. Pomerance (Ed.), Advances in Cryptology - CRYPTO '87: Proceedings (pp. 156-166). Springer. https://doi.org/10.1007/3-540-48184-2_11

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

Zhao, Y., Nielsen, J. B., Deng, R. H. & Feng, D. (2005). Generic yet Practical ZK Arguments from any Public-Coin HVZK. Electronic Colloquium on Computational Complexity, (TR05-162), 1-16.

Damgård, I. B. & Koprowski, M. (2002). Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups. In L. R. Knudsen (Ed.), Advances in Cryptology - EUROCRYPT 2002: International Conference on the Theory and Applications of Cryptographic Techniques Amsterdam, The Netherlands, April 28 - May 2, 2002 Proceedings (pp. 256-271). Springer. https://doi.org/10.1007/3-540-46035-7_17

Erkin, Z., Veugen, T., Toft, T. & Lagendijk, R. L. (2012). Generating Private Recommendations Efficiently Using Homomorphic Encryption and Data Packing. I E E E Transactions on Information Forensics and Security, 7(3), 1053 - 1066 . https://doi.org/10.1109/TIFS.2012.2190726

Displaying results 351 to 400 out of 617

8

Revised 02.06.2023

-

Marianne Dammand Iversen