Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Damgård, I. B. & Knudsen, L. R. (1996). Multiple encryption with minimum key. In E. Dawson & J. Golic (Eds.), Cryptography: Policy and Algorithms: International Conference Brisbane, Queensland, Australia, July 3-5, 1995 Proceedings (pp. 156-164). Springer. https://doi.org/10.1007/BFb0032355

Chaum, D., Crépeau, C. & Damgård, I. B. (1987). Multiparty Unconditionally Secure Protocols (Abstract). In C. Pomerance (Ed.), Advances in Cryptology - CRYPTO '87: Proceedings (pp. 462). Springer. https://doi.org/10.1007/3-540-48184-2_43

Chaum, D., Crépeau, C. & Damgård, I. B. (1988). Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM symposium on Theory of computing (pp. 11-19). Association for Computing Machinery. https://doi.org/10.1145/62212.62214

Scholl, P., Simkin, M. & Siniscalchi, L. (2022). Multiparty Computation with Covert Security and Public Verifiability. In D. Dachman-Soled (Ed.), 3rd Conference on Information-Theoretic Cryptography, ITC 2022 Article 8 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2022.8

Chaum, D., Damgård, I. B. & van der Graaf, J. (1987). Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result. In C. Pomerance (Ed.), Advances in Cryptology - CRYPTO '87: Proceedings (pp. 87-119). Springer. https://doi.org/10.1007/3-540-48184-2_7

Escudero Ospina, D. E. (2021). Multiparty Computation over Z=2^kΖ. Aarhus Universitet.

Cramer, R., Damgård, I. B. & Nielsen, J. B. (2001). Multiparty Computation from Threshold Homomorphic Encryption. 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. 280-300). Springer. https://doi.org/10.1007/3-540-44987-6_18

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

Damgård, I. B., Pastro, V., Smart, N. & Zakarias, S. N. H. (2012). Multiparty computation from somewhat homomorphic encryption. Lecture Notes in Computer Science, 7417, 643-662. https://doi.org/10.1007/978-3-642-32009-5_38

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

Ciampi, M., Siniscalchi, L. & Waldner, H. (2021). Multi-Client Functional Encryption for Separable Functions. 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 I (pp. 724-753). Springer. https://doi.org/10.1007/978-3-030-75245-3_26

Keller, H., Orlandi, C., Paskin-Cherniavsky, A. & Ravi, D. (2023). MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. In K-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 11:1-11:22). Article 11 Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2023.11

Baum, C., Braun, L., Munch-Hansen, A. & Scholl, P. (2022). MozZ2karella: Efficient Vector-OLE and Zero-Knowledge Proofs over Z2k. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 329-358). Springer. https://doi.org/10.1007/978-3-031-15985-5_12

Braun, L., Demmler, D., Schneider, T. & Tkachenko, O. (2022). MOTION – A Framework for Mixed-Protocol Multi-Party Computation. ACM Transactions on Privacy and Security, 25(2), Article 8. https://doi.org/10.1145/3490390

Guimaraes, A., Borin, E. & Aranha, D. F. (2022). MOSFHET: Optimized Software for FHE over the Torus. Abstract from 5th Homomorphic Encryption Standards Meeting, Geneva, Switzerland.

Baum, C., Damgård, I., Lyubashevsky, V., Oechsner, S. & Peikert, C. (2018). More Efficient Commitments from Structured Lattice Assumptions. In D. Catalano & R. De Prisco (Eds.), Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings (Vol. 11035, pp. 368-385). Springer VS. https://doi.org/10.1007/978-3-319-98113-0_20

Damgård, I. B., Li, B. & Schwartzbach, N. I. (2021). More communication lower bounds for information-theoretic MPC. In S. Tessaro (Ed.), 2nd Conference on Information-Theoretic Cryptography, ITC 2021 Article 2 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2021.2

Espitau, T., Takahashi, A., Tibouchi, M. & Wallet, A. (2021). Mitaka: A simpler, parallelizable, maskable variant of Falcon. Paper presented at Third PQC Standardization Conference, Washington, United States. https://csrc.nist.gov/CSRC/media/Events/third-pqc-standardization-conference/documents/accepted-papers/espitau-mitaka-pqc2021.pdf

Espitau, T., Fouque, P-A., Gérard, F., Rossi, M., Takahashi, A., Tibouchi, M., Wallet, A. & Yu, Y. (2022). MITAKA: A Simpler, Parallelizable, Maskable Variant of Falcon. In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (Vol. 3, pp. 222-253). Springer. https://doi.org/10.1007/978-3-031-07082-2_9

Deuber, D., Döttling, N., Magri, B., Malavolta, G. & Thyagarajan, S. A. K. (2020). Minting Mechanism for Proof of Stake Blockchains. In M. Conti, J. Zhou, E. Casalicchio & A. Spognardi (Eds.), Applied Cryptography and Network Security (pp. 315-334). Springer. https://doi.org/10.1007/978-3-030-57808-4_16

Nordholt, P. S. & Veeningen, M. (2018). Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification. In Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Proceedings (pp. 321-339) https://eprint.iacr.org/2018/474.pdf

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

Faonio, A., Nielsen, J. B. & Venturi, D. (2015). Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation. In M. M. Halldórsson, K. Iwama, N. Kobayashi & B. Speckmann (Eds.), Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I (Vol. Part 1, pp. 456-468). Springer VS. https://doi.org/10.1007/978-3-662-47672-7_37

Thomsen, S. E. (2023). Message Dissemination in the Nakamoto Era. Aarhus Universitet.

Blundo, C., Cimato, S. & Siniscalchi, L. (2020). Managing Constraints in Role Based Access Control. IEEE Access, 8, 140497-140511. Article 9146129. https://doi.org/10.1109/ACCESS.2020.3011310

Ghosh, S., Nielsen, J. B. & Nilges, T. (2017). Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. In T. Takagi & T. Peyrin (Eds.), Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (Vol. 10624, pp. 629-659). Springer VS. https://doi.org/10.1007/978-3-319-70694-8_22

Baum, C., Malozemoff, A. J., Scholl, P. & Rosen, M. (2021). Mac’n’Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. In Advances in Cryptology – CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings: Proceedings (pp. 92-122). Springer. https://doi.org/10.1007/978-3-030-84259-8_4

Campanelli, M., Faonio, A., Fiore, D., Querol, A. & Rodríguez, H. (2021). Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions. In M. Tibouchi & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2021: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part III (pp. 3-33). Springer. https://doi.org/10.1007/978-3-030-92078-4_1

Jacob, R., Larsen, K. G. & Nielsen, J. B. (2019). Lower Bounds for Oblivious Data Structures. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2439-2447). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.149

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (pp. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

Nielsen, J. B. & Simkin, M. (2020). Lower bounds for leakage-resilient secret sharing. In A. Canteaut & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 556-577). Springer. https://doi.org/10.1007/978-3-030-45721-1_20

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

Hazay, C., Scholl, P. & Soria-Vazquez, E. (2020). Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. Journal of Cryptology, 33(4), 1732-1786. Advance online publication. https://doi.org/10.1007/s00145-020-09355-y

Hazay, C., Scholl, P. & Soria-Vazquez, E. (2017). Low cost constant round MPC combining BMR and oblivious transfer. In T. Takagi & T. Peyrin (Eds.), Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (Vol. 10624, pp. 598-628). Springer VS. https://doi.org/10.1007/978-3-319-70694-8_21

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2021). Low-Complexity Weak Pseudorandom Functions in textdollartextbackslashmathtt AC0[textbackslashmathtt MOD2]textdollar. In T. Malkin & C. Peikert (Eds.), Advances in Cryptology – CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV (pp. 487-516). Springer. https://doi.org/10.1007/978-3-030-84259-8_17

Abram, D. & Scholl, P. (2022). Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN. 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. 221-251). Springer. https://doi.org/10.1007/978-3-030-97121-2_9

Abram, D., Nof, A., Orlandi, C., Scholl, P. & Shlomovits, O. (2022). Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. In 2022 IEEE Symposium on Security and Privacy (SP) (pp. 2554-2572). IEEE. https://doi.org/10.1109/SP46214.2022.9833559

Aranha, D. F., Pagnin, E. & Rodriguez-Henriquez, F. (2021). LOVE a Pairing. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 (pp. 320-340). Springer. https://doi.org/10.1007/978-3-030-88238-9_16

Cramer, R. & Damgård, I. B. (1997). Linear zero-knowledge-a note on efficient zero-knowledge proofs and arguments. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (pp. 436-445). Association for Computing Machinery. https://doi.org/10.1145/258533.258635

Cramer, R., Damgård, I. B., Döttling, N., Giacomelli, I. & Xing, C. (2016). Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. (pp. 1-31). Cryptology ePrint Archive. http://ia.cr/2016/397

Cramer, R., Damgård, I., Döttling, N., Giacomelli, I. & Xing, C. (2017). Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. In J. Shikata (Ed.), Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings (Vol. 10681, pp. 1-25). Springer VS. https://doi.org/10.1007/978-3-319-72089-0_1

Cramer, R., Damgård, I. B., Döttling, N. M., Fehr, S. & Spini, G. (2015). Linear secret sharing schemes from error correcting codes and universal hash functions. In E. Oswald & M. F. 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. 313-336). Springer VS. https://doi.org/10.1007/978-3-662-46803-6_11

Damgård, I. B. & Thorbek, R. (2006). Linear Integer Secret Sharing and Distributed Exponentiation. In M. Yung, Y. Dodis, A. Kiayias & T. Malkin (Eds.), Public Key Cryptography - PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24-26, 2006. Proceedings (pp. 75-90). Springer. https://doi.org/10.1007/11745853_6

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

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

Rachuri, R. & Scholl, P. (2022). Le Mans: Dynamic and Fluid MPC for Dishonest Majority. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 719-749). Springer. https://doi.org/10.1007/978-3-031-15802-5_25

Nielsen, J. B. & Orlandi, C. (2009). LEGO for Two-Party Secure Computation. Lecture Notes in Computer Science, 5444, 368-386. https://doi.org/10.1007/978-3-642-00457-5_22

Damgård, I. B. (Ed.) (1999). Lectures on Data Security: Modern Cryptology in Theory and Practice. Springer. Lecture Notes in Computer Science Vol. 1561 https://doi.org/10.1007/3-540-48969-X

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

Damgård, I. B., Hazay, C. & Patra, A. (2012). Leakage Resilient Secure Two-Party Computation. http://eprint.iacr.org/2011/256

Displaying results 301 to 350 out of 617

7

Revised 02.06.2023

-

Marianne Dammand Iversen