| Publication | Date of Publication | Type |
|---|
| Fast batched asynchronous distributed key generation | 2024-11-13 | Paper |
| Lightweight asynchronous verifiable secret sharing with optimal resilience | 2024-07-10 | Paper |
| Internet Computer Consensus | 2024-03-26 | Paper |
| On the security of ECDSA with additive key derivation and presignatures | 2022-08-30 | Paper |
| Security analysis of \textit{SPAKE2+} | 2022-03-23 | Paper |
| Arithmetic Software Libraries | 2022-02-25 | Paper |
| Bootstrapping for helib | 2021-04-07 | Paper |
| An improved RNS variant of the BFV homomorphic encryption scheme | 2020-01-28 | Paper |
| Faster homomorphic linear transformations in HElib | 2018-09-12 | Paper |
| Factorization in Z[x] | 2015-11-26 | Paper |
| On Fast and Provably Secure Message Authentication Based on Universal Hashing | 2015-11-11 | Paper |
| Bootstrapping for HElib | 2015-09-30 | Paper |
| GNUC: a new universal composability framework | 2015-08-03 | Paper |
| Random oracles in constantipole | 2015-03-03 | Paper |
| Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn | 2014-10-16 | Paper |
| Session Key Distribution Using Smart Cards | 2014-08-20 | Paper |
| On the Security of a Practical Identification Scheme | 2014-08-20 | Paper |
| Algorithms in HElib | 2014-08-07 | Paper |
| Practical chosen ciphertext secure encryption from factoring | 2013-04-15 | Paper |
| A Framework for Practical Universally Composable Zero-Knowledge Protocols | 2011-12-02 | Paper |
| Credential Authenticated Identification and Key Exchange | 2010-08-24 | Paper |
| Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model | 2010-05-28 | Paper |
| A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack | 2010-03-01 | Paper |
| The twin Diffie-Hellman problem and applications | 2009-11-13 | Paper |
| A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks | 2009-05-12 | Paper |
| Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301801 | 2009-01-20 | Paper |
| Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM | 2008-05-06 | Paper |
| The Twin Diffie-Hellman Problem and Applications | 2008-04-15 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography | 2006-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374942 | 2006-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374928 | 2006-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374914 | 2006-03-01 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5316395 | 2005-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737235 | 2004-08-11 | Paper |
| Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418529 | 2003-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409134 | 2003-06-30 | Paper |
| OAEP reconsidered | 2003-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785503 | 2003-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783729 | 2002-12-08 | Paper |
| Algorithms for exponentiation in finite fields | 2002-11-12 | Paper |
| Securing threshold cryptosystems against chosen ciphertext attack | 2002-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526994 | 2001-02-28 | Paper |
| On the security of a practical identification scheme | 2000-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4237366 | 2000-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234088 | 1999-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226960 | 1999-09-10 | Paper |
| Securing threshold cryptosystems against chosen ciphertext attack | 1999-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249317 | 1999-06-17 | Paper |
| Optimistic fair exchange of digital signatures | 1999-06-17 | Paper |
| Lower bounds for polynomial evaluation and interpolation problems | 1998-09-20 | Paper |
| Subquadratic-time factoring of polynomials over finite fields | 1998-06-14 | Paper |
| Constructing nonresidues in finite fields and the extended Riemann hypothesis | 1996-12-03 | Paper |
| A new polynomial factorization algorithm and its implementation | 1996-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847916 | 1995-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140455 | 1994-11-09 | Paper |
| Fast construction of irreducible polynomials over finite fields | 1994-10-13 | Paper |
| Primality testing with fewer random bits | 1994-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279585 | 1994-03-07 | Paper |
| Computing Frobenius maps and factoring polynomials | 1993-06-29 | Paper |
| Searching for Primitive Roots in Finite Fields | 1992-06-28 | Paper |
| Smoothness and factoring polynomials over finite fields | 1992-06-26 | Paper |
| On the deterministic complexity of factoring polynomials over finite fields | 1990-01-01 | Paper |
| New Algorithms for Finding Irreducible Polynomials Over Finite Fields | 1990-01-01 | Paper |
| Factoring polynomials using fewer random bits | 1990-01-01 | Paper |
