Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Khoshakhlagh, H. (2022). Cryptography for Scalability and Identity in Blockchain Applications. Aarhus Universitet.

Ganesh, C., Magri, B. & Venturi, D. (2020). Cryptographic reverse firewalls for interactive proof systems. In A. Czumaj, A. Dawar & E. Merelli (Eds.), 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020 (pp. 55:1-55:16). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2020.55

Ganesh, C., Magri, B. & Venturi, D. (2021). Cryptographic reverse firewalls for interactive proof systems. Theoretical Computer Science, 855, 104-132. https://doi.org/10.1016/j.tcs.2020.11.043

Hirt, M., Nielsen, J. B. & Przydatek, B. (2005). Cryptographic Asynchronous Multi-party Computation with Optimal Resilience: Extended abstract. In R. Cramer (Ed.), Advances in Cryptology – EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005. Proceedings (pp. 322-340). Springer LNCS 3494. https://doi.org/10.1007/11426639_19

Hubacek, P. & Park, S. (2014). Cryptographically Blinded Games: Leveraging Players' Limitations for Equilibria and Profit. In M. Babaioff (Ed.), 15th ACM Conference on Economics and Computation, EC '14 (pp. 207-208). Association for Computing Machinery. https://doi.org/10.1145/2600057.2602903

Surita, R. C., Cortes, M. L., Aranha, D. F. & Araujo, G. (2018). CRPUF: A modeling-resistant delay PUF based on cylindrical reconvergence. Microprocessors and Microsystems, 60, 185-195. https://doi.org/10.1016/j.micpro.2018.05.006

Aranha, D. F., Ribeiro, H. & Ogando Paraense, A. L. (2016). Crowdsourced integrity verification of election results. Annals of Telecommunications, 71(7-8), 287-297. https://doi.org/10.1007/s12243-016-0511-1

Nielsen, J. B. & Orlandi, C. (2016). Cross and Clean: Amortized Garbled Circuits with Constant Overhead. In M. Hirt & A. Smith (Eds.), Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings (Vol. 9985, pp. 582-603). Springer VS. https://doi.org/10.1007/978-3-662-53641-4_22

Aranha, D. F., Hall-Andersen, M. N., Nitulescu, A., Pagnin, E. & Yakoubov, S. (2022). Count Me In! Extendability for Threshold Ring Signatures. 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, Proceedings, Part II (pp. 379-406). Springer. https://doi.org/10.1007/978-3-030-97131-1_13

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N. & Scholl, P. (2022). Correlated Pseudorandomness from Expand-Accumulate Codes. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 603-633). Springer. https://doi.org/10.1007/978-3-031-15979-4_21

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2020). Correlated Pseudorandom Functions from Variable-Density LPN. In S. Irani (Ed.), Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020 (pp. 1069-1080). Article 9317926 IEEE. https://doi.org/10.1109/FOCS46700.2020.00103

Chiang, J. H. Y., David, B., Gama, M. & Lebeda, C. J. (2023). Correlated-Output Differential Privacy and Applications to Dark Pools. In J. Bonneau & S. M. Weinberg (Eds.), 5th Conference on Advances in Financial Technologies, AFT 2023 Article 11 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AFT.2023.11

Boyar, J., Chaum, D., Damgård, I. B. & Pedersen, T. (1990). Convertible Undeniable Signatures. In A. J. Menezez & S. A. Vanstone (Eds.), Advances in Cryptology - CRYPT0' 90: Proceedings (pp. 189-205). Springer. https://doi.org/10.1007/3-540-38424-3_14

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

Damgård, I., Kazana, T., Obremski, M., Raj, V. & Siniscalchi, L. (2018). Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. In A. Beimel & S. Dziembowski (Eds.), Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings (Vol. 11240, pp. 225-254). Springer VS. https://doi.org/10.1007/978-3-030-03810-6_9

Faonio, A., Nielsen, J. B., Simkin, M. & Venturi, D. (2018). Continuously Non-malleable Codes with Split-State Refresh. In B. Preneel & F. Vercauteren (Eds.), Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Proceedings (Vol. 10892, pp. 121-139). Springer VS. https://doi.org/10.1007/978-3-319-93387-0_7

Faonio, A., Buus Nielsen, J., Simkin, M. & Venturi, D. (2019). Continuously non-malleable codes with split-state refresh. Theoretical Computer Science, 759, 98-132. https://doi.org/10.1016/j.tcs.2018.12.028

Faust, S., Mukherjee, P., Nielsen, J. B. & Venturi, D. (2020). Continuously Non-malleable Codes in the Split-State Model. Journal of Cryptology, 33(4), 2034-2077. https://doi.org/10.1007/s00145-020-09362-z

Oechsner, S. (2019). Constructions and Proof Techniques for Secure Computation. Aarhus Universitet.

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. & Ishai, Y. (2005). Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In V. Shoup (Ed.), Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005. Proceedings (pp. 378-394). Springer. https://doi.org/10.1007/11535218_23

Nielsen, J. B., Schneider, T. & Trifiletti, R. (2017). Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In NDSS ’17 (pp. 1-15). Internet Society. https://doi.org/10.14722/ndss.2017.23075

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

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

Damgård, I., Damgård, K., Nielsen, K., Nordholt, P. S. & Toft, T. (2017). Confidential benchmarking based on multiparty computation. In J. Grossklags & B. Preneel (Eds.), Financial Cryptography and Data Security - 20th International Conference, FC 2016, Revised Selected Papers (Vol. 9603 LNCS, pp. 169-187). Springer VS. https://doi.org/10.1007/978-3-662-54970-4_10

Baum, C. & Nof, A. (2020). Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. In A. Kiayias, M. Kohlweiss, P. Wallden & V. Zikas (Eds.), Public-Key Cryptography – PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (Vol. 1, pp. 495-526). Springer. https://doi.org/10.1007/978-3-030-45374-9_17

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). In T. Peyrin & S. Galbraith (Eds.), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (Vol. 11274, pp. 86-117). Springer VS. https://doi.org/10.1007/978-3-030-03332-3_4

Damgård, I. B. (1987). Concatenated Group Codes and Their Exponents. I E E E Transactions on Information Theory, Vol. 33, Issue 6.

Bang Mbiang, N., Aranha, D. F. & Fouotsa, E. (2020). Computing the optimal Ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level. International Journal of Applied Cryptography, 4(1), 45-59. https://doi.org/10.1504/IJACT.2020.107167

Hoffman, C., Cortes, M. L., Aranha, D. F. & Araujo, G. (2015). Computer security by hardware-intrinsic authentication. In 2015 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS) (pp. 143-152). IEEE. https://doi.org/10.1109/CODESISSS.2015.7331377

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P. (2018). Computer-Aided Proofs for Multiparty Computation with Active Security. In Proceedings - IEEE 31st Computer Security Foundations Symposium, CSF 2018 (Vol. 2018, pp. 119-131). Article 8429300 IEEE. https://doi.org/10.1109/CSF.2018.00016

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P-Y. (2018, Jun 19). Computer-aided proofs for multiparty computation with active security. arXiv.org. Computer Security Foundations https://arxiv.org/abs/1806.07197

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. https://doi.org/10.1007/978-3-642-25385-0_32

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

Hazay, C. & Toft, T. (2014). Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. Journal of Cryptology, 27(2), 358-395. https://doi.org/10.1007/s00145-013-9147-8

Damgård, I., Luo, J., Oechsner, S., Scholl, P. & Simkin, M. (2018). Compact Zero-Knowledge Proofs of Small Hamming Weight. In M. Abdalla & R. Dahab (Eds.), Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (Vol. 10770, pp. 530-560). Springer VS. https://doi.org/10.1007/978-3-319-76581-5_18

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

Damgård, I., Larsen, K. G. & Nielsen, J. B. (2019). Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. In A. Boldyreva & D. Micciancio (Eds.), Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings (Vol. II, pp. 61-84). Springer. https://doi.org/10.1007/978-3-030-26951-7_3

Damgård, I. B., Haagh, H., Nielsen, M. & Orlandi, C. (2019). Commodity-Based 2PC for Arithmetic Circuits. Cryptology ePrint Archive.

Damgård, I., Haagh, H., Nielsen, M. & Orlandi, C. (2019). Commodity-Based 2PC for Arithmetic Circuits. In M. Albrecht (Ed.), Cryptography and Coding - 17th IMA International Conference, IMACC 2019, Proceedings (pp. 154-177). Springer. https://doi.org/10.1007/978-3-030-35199-1_8

Damgård, I. B. (1999). Commitment Schemes and Zero-Knowledge Protocols. In I. B. Damgård (Ed.), Lectures on Data Security: Modern Cryptology in Theory and Practice (pp. 63-86). Springer. https://doi.org/10.1007/3-540-48969-X_3

Khoshakhlagh, H. (2022). (Commit-and-Prove) Predictable Arguments with Privacy. In G. Ateniese & D. Venturi (Eds.), Applied Cryptography and Network Security: 20th International Conference, ACNS 2022, Proceedings (pp. 542-561). Springer. https://doi.org/10.1007/978-3-031-09234-3_27

Ciampi, M. & Orlandi, C. (2018). Combining Private Set-Intersection with Secure Two-Party Computation. In D. Catalano & R. De Prisco (Eds.), Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings (Vol. 11035, pp. 464-482). Springer VS. https://doi.org/10.1007/978-3-319-98113-0

Damgård, I. B. (1987). Collision Free Hash Functions and Public Key Signature Schemes. In D. Chaum & W. L. Price (Eds.), Advances in Cryptology - EUROCRYPT' 87: Workshop on the Theory and Application of Cryptographic Techniques Amsterdam, The Netherlands, April 13-15, 1987 Proceedings (pp. 203-216). Springer. https://doi.org/10.1007/3-540-39118-5_19

Damgård, I. B. & Jurik, M. J. (2002). Client/Server Tradeoffs for On-line Elections. In D. Naccache & P. Pailier (Eds.), Public Key Cryptography: 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002 Paris, France, February 12-14, 2002 Proceedings (pp. 125-140). Springer. https://doi.org/10.1007/3-540-45664-3_9

Hoffman, C., Gebotys, C. H., Aranha, D. F., Cortes, M. L. & Araujo, G. (2019). Circumventing Uniqueness of XOR Arbiter PUFs. In Proceedings - Euromicro Conference on Digital System Design, DSD 2019 (pp. 222-229). Article 8875236 IEEE. https://doi.org/10.1109/DSD.2019.00041

Dalskov, A., Lee, E. & Soria-Vazquez, E. (2020). Circuit Amortization Friendly Encodingsand Their Application to Statistically Secure Multiparty Computation. In S. Moriai & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings (pp. 213-243). Springer. https://doi.org/10.1007/978-3-030-64840-4_8

Dalskov, A. P. K., Lee, E. & Soria Vazquez, E. (2020). Circuit Amortization Friendly Encodings and their Application to Statistically Secure Multiparty Computation. In S. Moriai & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7–11, 2020, Proceedings (Vol. III). Springer.

Dalskov, A. P. K. (2020). Cats or Croissants? Techniques for Secure Inference. Aarhus Universitet.

Dalskov, A. P. K. & Orlandi, C. (2018). Can You Trust Your Encrypted Cloud?: An Assessment of SpiderOakONE's Security. In J. Kim, G-J. Ahn & S. Kim (Eds.), ASIACCS 2018 - Proceedings of the 2018 ACM Asia Conference on Computer and Communications Security (pp. 343-355). Association for Computing Machinery. https://doi.org/10.1145/3196494.3196547

Displaying results 501 to 550 out of 624

11

Revised 04.10.2023

-

Marianne Dammand Iversen