People

Alumni

Publications

In press (incomplete)

 

 

FOUNDATIONS IN CRYPTOLOGY AND SECURITY


Foundations In Cryptology and Security is a research centre established by Department of Computer Science at Aarhus University and Department of Mathematics at the Technical University of Denmark, Copenhagen, supported by the Danish National Science Research Council grant No. 21-02-0093.  
 
 

News

 

People

  • Ivan B. Damgaard, Computer Science Department, Aarhus University
  • Lars R. Knudsen, Department of Mathematics, Technical University of Denmark
  • Tanja Lange, Department  Mathematics, Technical University of Denmark
  • James L. Massey, Department of Mathematics, Technical University of Denmark
  • Enes Pasalic, Department of Mathematics, Technical University of Denmark
  • Jesper Buus Nielsen, Computer Science Department, Aarhus University
  • Louis Salvail, Computer Science Department, Aarhus University

Alumni

 
Publications

  • Nye veje til Datasikkerhed, (in Danish), af Ivan B. Damgaard Computer Science Department, Aarhus University
  • Analysis of RMAC, by Lars R. Knudsen, Department of Mathematics, DTU
  • Jeg har "knaekket" en kode, (in Danish) by Lars R. Knudsen, Department of Mathematics, DTU, October 2003.
  • Ronald Cramer, Ivan Damgård: Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. TCC 2004: 223-237, Springer Verlag LNCS
  • Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz: Efficient Multi-party Computation over Rings. EUROCRYPT 2003: 596-613, Springer Verlag LNCS.
  • Ivan Damgård, Mads Jurik: A Length-Flexible Threshold Cryptosystem with Applications. ACISP 2003: 350-364, Springer Verlag LNCS
  • Ivan Damgård, Jesper Buus Nielsen: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. CRYPTO 2003: 247-264, Springer Verlag LNCS
  • Ivan Damgård, Gudmund Skovbjerg Frandsen: Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. FCT 2003: 109-117, Springer Verlag LNCS
  • Ivan Damgård, Gudmund Skovbjerg Frandsen: An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. FCT 2003: 118-131, Springer Verlag LNCS, extended version to appear in “Algorithmic Number Theory”.
  • Ivan Damgård, Jens Groth: Non-interactive and reusable non-malleable commitment schemes. STOC 2003: 426-437, ACM.
  • Jens Groth: Evaluating Security of Voting Schemes in the Universal Composability Framework, Applied Cryptography and Network Security - ACNS 2004, LNCS 3089.
  • Jens Groth: Rerandomizable and Replayable Adaptive Chosen Ciphertext Secure Cryptosystems, Theory of Cryptography Conference - TCC 2004, LNCS 2951.
  • Jens Groth: Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast, Financial Cryptography - FC 2004, LNCS 3110.
  • Jens Groth: A Verifiable Secret Shuffle of Homomorphic Encryptions, Practice and Theory in Public Key Cryptography - PKC 2003, LNCS 2567.
  • L.R. Knudsen, C.J. Mitchell: Analysis of 3gpp-MAC and two-key 3gpp-MAC. Discrete Applied Mathematics, 128 (2003) pp. 181-191.
  • L.R. Knudsen, H. Raddum: Distinguishing Attack on 5-Round Feistel Networks. Electronics Letters, Aug. 2003, Vol. 39, No. 16, pages 1175-1177.
  • Ivan Damgård, Thomas Pedersen, Louis Salvail: On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-Way Quantum Transmission. EUROCRYPT 2004: 91-108, Springer Verlag LNCS.
  • Ivan Damgård, Serge Fehr, Kirill Morozov, Louis Salvail: Unfair Noisy Channels and Oblivious Transfer. TCC 2004: 355-373, Springer Verlag LNCS.
  • Claude Crépeau, Paul Dumais, Dominic Mayers, Louis Salvail: Computational Collapse of Quantum State with Application to Oblivious Transfer. TCC 2004: 374-393, Springer Verlag LNCS.
  • Crepeau, C., Morozov, K., Wolf, S.: Efficient Unconditional Oblivious Transfer from Almost any Noisy Channel. Accepted to Fourth Conference on Security in Communication Networks '04, Amalfi (Italy), September, 2004
  • L.R. Knudsen, J.E. Mathiassen. On the Role of Key Schedules in Attacks on Iterated Ciphers. Computer Security - ESORICS 2004, 9th European Symposium on Research Computer Security, Sophia Antipolis, France, September 13-15, 2004.  Springer Lecture Notes in Computer Science Vol 3193, pp. 322-334, Springer Verlag, 2004.
  • L.R. Knudsen.  Block Ciphers. Encyclopedia of Cryptography and Security. Henk C.A.  van Tilborg, Ed., pp. 41-48, Springer Science, 2005.
  • L.R. Knudsen. Luby-Rackoff Ciphers. Encyclopedia of Cryptography and Security. Henk C.A.  van Tilborg, Ed., pp. 358-360, Springer Science, 2005.
  • L.R. Knudsen, C.J. Mitchell. Partial key recovery attack against RMAC. Journal of Cryptology, vol. 18, no. 4, 375-389, 2005.
  • L.R. Knudsen, F. Muller.  Some Attacks Against a Double Length Hash Proposal.  Advances in Cryptology - ASIACRYPT 2005, Springer Lecture Notes in Computer Science Vol 3788, pp. 462-473, Springer Verlag, 2005.
  • H. Dobbertin, L.R. Knudsen, and Matt Robshaw. The Cryptanalysis of the AES - A Brief Survey. AES 2004, Lecture Notes in Computer Science Vol. 3373, pp. 1-10, Springer Verlag, 2005.
  • L.R. Knudsen. SMASH - a cryptographic hash function. Fast Software Encryption, Lecture Notes in Computer Science Vol 3557, pp. 228-242, Springer Verlag, 2005.
  • L.R. Knudsen, J.E. Mathiassen. Preimage and collision attacks on MD2. Fast Software Encryption, Lecture Notes in Computer Science Vol 3557, pp. 255-267, Springer Verlag, 2005.
  • L.R. Knudsen. Small size hashes with enhanced security. International Journal of Network Security, Vol.2, No.1, pp.41-42, Jan. 2006.
  • L.R. Knudsen, S.S. Thomsen.  Proposals for Iterated Hash Functions. Proceedings of SECRYPT 2006. International Conference on Security and Cryptography, pp. 246-253, INSTICC, 2006. ISBN 97-28-86563-5.
  • Tanja Lange.Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions -- Full Version (with M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi), submitted.
  • Tanja Lange. Distribution of Some Sequences of Points on Elliptic Curves (with I. Shparlinski), to appear in Journal of Mathematical Cryptography.
  • Tanja Lange. Certain exponential sums and random walks on elliptic curves (with I. Shparlinski), Canadian Journal of Mathematics 57 (2005), 338-350.
  • Tanja Lange. Koblitz Curve Cryptosystems, Finite Fields and Their Applications 11 (2005), 200-229.
  • Tanja Lange. Formulae for Arithmetic on Genus 2 Hyperelliptic Curves, Journal of Applicable Algebra in Engineering, Communication and Computer Science 15 (2005), 295-328.
  • Tanja Lange. Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves, (with I. Shparlinski), Journal of Applicable Algebra in Engineering, Communication and Computer Science 15 (2005), 329-337.
  • Tanja Lange. Authenticated Burmester-Desmedt II  Group Key Exchange (with M. Burmester and Y. Desmedt), submitted.
  • Tanja Lange. Fast bilinear maps from the Tate-Lichtenbaum pairing on hyperelliptic curves, (with G. Frey), Proceedings of  ANTS 2006, LNCS 4076, 466-479.
  • Tanja Lange. Interpolation of the discrete logarithm in a finite field of characteristic two by Boolean functions (with N. Brandstatter and A. Winterhof), full version, to appear in the post-proceedings of WCC'2005.
  • Tanja Lange. Pairing Based Threshold Cryptography Improving on Libert-Quisquater and Baek-Zheng (with Y. Desmedt), Proceedings of Financial Crypto 2006.
  • Tanja Lange. SCA resistant Parallel Explicit Formula for Addition and Doubling of Divisors in the Jacobian of Hyperelliptic Curves of Genus 2  (with P. K. Mishra), Proceedings of Indocrypt 2005, LNCS 3797, 403-416.
  • Tanja Lange. Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions (with M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi), Crypto 2005.
  • Tanja Lange. Arithmetic on Binary Genus  Curves Suitable for Small Devices, ECRYPT lightweight and RFID workshop Graz 2005.
  • Tanja Lange. Interpolation of the discrete logarithm in a finite field of characteristic two by Boolean functions (with N. Brandstatter and A. Winterhof), WCC 2005.
  • Tanja Lange. Mathematical Background of Public Key Cryptography (with G.  Frey), ``Seminaires et congres'' 11, 41-73, 2005.
  • Tanja Lange. The Handbook of Elliptic and Hyperelliptic Curve Cryptography, (with R. Avanzi, H. Cohen, C. Doche, G. Frey, K.  Nguyen, F. Vercauteren),   CRC Press 2005.
  • Ivan Damgård, Kasper Dupont, Michael Østergaard Pedersen: Unclonable Group Identification. EUROCRYPT 2006: 555-572
  • Jesús F. Almansa, Ivan Damgård, Jesper Buus Nielsen: Simplified Threshold RSA with Adaptive and Proactive Security. EUROCRYPT 2006: 593-611
  • Ivan Damgård, Rune Thorbek: Linear Integer Secret Sharing and Distributed Exponentiation. Public Key Cryptography 2006: 75-90
  • Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. TCC 2006: 285-304
  • Ivan Damgård, Nelly Fazio, Antonio Nicolosi: Non-interactive Zero-Knowledge from Homomorphic Encryption. TCC 2006: 41-59 2005
  • Ivan Damgård, Yuval Ishai: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. CRYPTO 2005: 378-394
  • Ivan Damgård, Thomas Brochmann Pedersen, Louis Salvail: A Quantum Cipher with Near Optimal Key-Recycling. CRYPTO 2005: 494-510
  • Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner: Cryptography In the Bounded Quantum-Storage Model. FOCS 2005: 449-458
  • Ivan Damgård, Kasper Dupont: Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions. Public Key Cryptography 2005: 346-361
  • Ronald Cramer, Ivan Damgård, Yuval Ishai: Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. TCC 2005: 342-362
  • Ivan Damgård, Gudmund Skovbjerg Frandsen: Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers. J. Symb. Comput. 39(6): 643-652 (2005) 2004
  • Ivan Damgård, Serge Fehr, Louis Salvail: Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks. CRYPTO 2004: 254-272
  • Martin Hirt, Jesper Buus Nielsen: Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation. ASIACRYPT 2005: 79-99
  • Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek: Cryptographic Asynchronous Multi-party Computation with Optimal Resilience  (Extended Abstract). EUROCRYPT 2005: 322-340
  • Yunlei Zhao, Jesper Buus Nielsen, Robert H. Deng, Dengguo Feng: Generic yet Practical ZK Arguments from any Public-Coin HVZK Electronic Colloquium on Computational Complexity (ECCC)(162): (2005) 2004
  • Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass: Universally Composable Protocols with Relaxed Set-Up Assumptions. FOCS 2004: 186-195
  • Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan: Round-Optimal and Efficient Verifiable Secret Sharing. TCC 2006: 329-342 2005
  • Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky: Minimal Complete Primitives for Secure Multi-Party Computation. J. Cryptology 18(1): 37-61 (2005)
  • Jeffrey Considine, Matthias Fitzi, Matthew K. Franklin, Leonid A.  Levin, Ueli M. Maurer, David Metcalf: Byzantine Agreement Given Partial Broadcast. J. Cryptology 18(3): 191-217 (2005)

 

 

 

LNCS stands for Lecture Notes in Computer Science