| Publication | Date of Publication | Type |
|---|
| MiniCast: minimizing the communication complexity of reliable broadcast | 2025-12-02 | Paper |
| Fast batched asynchronous distributed key generation | 2024-11-13 | Paper |
Lightweight asynchronous verifiable secret sharing with optimal resilience
Journal of Cryptology | 2024-07-10 | Paper |
Internet Computer Consensus
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 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
Journal of Cryptology | 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]
Proceedings of the 2000 international symposium on Symbolic and algebraic computation | 2015-11-26 | Paper |
On fast and provably secure message authentication based on universal hashing
Advances in Cryptology — CRYPTO ’96 | 2015-11-11 | Paper |
Bootstrapping for HElib
Advances in Cryptology -- EUROCRYPT 2015 | 2015-09-30 | Paper |
GNUC: a new universal composability framework
Journal of Cryptology | 2015-08-03 | Paper |
Random oracles in constantipole
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn
Lecture Notes in Computer Science | 2014-10-16 | Paper |
Session key distribution using smart cards
Advances in Cryptology — EUROCRYPT ’96 | 2014-08-20 | Paper |
On the security of a practical identification scheme
Advances in Cryptology — EUROCRYPT ’96 | 2014-08-20 | Paper |
Algorithms in HElib
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Practical chosen ciphertext secure encryption from factoring
Journal of Cryptology | 2013-04-15 | Paper |
A framework for practical universally composable zero-knowledge protocols
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Credential authenticated identification and key exchange
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack
Journal of Cryptology | 2010-03-01 | Paper |
The twin Diffie-Hellman problem and applications
Journal of Cryptology | 2009-11-13 | Paper |
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
Advances in Cryptology - EUROCRYPT 2009 | 2009-05-12 | Paper |
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
Lecture Notes in Computer Science | 2009-02-10 | Paper |
| A computational introduction to number theory and algebra | 2009-01-20 | Paper |
Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
Lecture Notes in Computer Science | 2008-05-06 | Paper |
The Twin Diffie-Hellman Problem and Applications
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
Journal of Cryptology | 2006-09-12 | Paper |
| Practical threshold signatures | 2006-03-01 | Paper |
| A composition theorem for universal one-way hash functions | 2006-03-01 | Paper |
| Using hash functions as a hedge against chosen ciphertext attack | 2006-03-01 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
| scientific article; zbMATH DE number 2204782 (Why is no real title available?) | 2005-09-13 | Paper |
| scientific article; zbMATH DE number 2086698 (Why is no real title available?) | 2004-08-11 | Paper |
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
SIAM Journal on Computing | 2004-01-08 | Paper |
| scientific article; zbMATH DE number 1962145 (Why is no real title available?) | 2003-08-10 | Paper |
| scientific article; zbMATH DE number 1942435 (Why is no real title available?) | 2003-06-30 | Paper |
OAEP reconsidered
Journal of Cryptology | 2003-03-25 | Paper |
| scientific article; zbMATH DE number 1848309 (Why is no real title available?) | 2003-02-25 | Paper |
| scientific article; zbMATH DE number 1842495 (Why is no real title available?) | 2002-12-08 | Paper |
Algorithms for exponentiation in finite fields
Journal of Symbolic Computation | 2002-11-12 | Paper |
Securing threshold cryptosystems against chosen ciphertext attack
Journal of Cryptology | 2002-06-27 | Paper |
| scientific article; zbMATH DE number 1559545 (Why is no real title available?) | 2001-02-28 | Paper |
On the security of a practical identification scheme
Journal of Cryptology | 2000-06-06 | Paper |
| scientific article; zbMATH DE number 1273636 (Why is no real title available?) | 2000-03-14 | Paper |
| scientific article; zbMATH DE number 1263216 (Why is no real title available?) | 1999-09-29 | Paper |
| scientific article; zbMATH DE number 1253982 (Why is no real title available?) | 1999-09-10 | Paper |
Securing threshold cryptosystems against chosen ciphertext attack
Lecture Notes in Computer Science | 1999-09-09 | Paper |
| scientific article; zbMATH DE number 1302835 (Why is no real title available?) | 1999-06-17 | Paper |
Optimistic fair exchange of digital signatures
Lecture Notes in Computer Science | 1999-06-17 | Paper |
Lower bounds for polynomial evaluation and interpolation problems
Computational Complexity | 1998-09-20 | Paper |
Subquadratic-time factoring of polynomials over finite fields
Mathematics of Computation | 1998-06-14 | Paper |
Constructing nonresidues in finite fields and the extended Riemann hypothesis
Mathematics of Computation | 1996-12-03 | Paper |
A new polynomial factorization algorithm and its implementation
Journal of Symbolic Computation | 1996-08-13 | Paper |
| scientific article; zbMATH DE number 799765 (Why is no real title available?) | 1995-10-25 | Paper |
| scientific article; zbMATH DE number 437575 (Why is no real title available?) | 1994-11-09 | Paper |
Fast construction of irreducible polynomials over finite fields
Journal of Symbolic Computation | 1994-10-13 | Paper |
Primality testing with fewer random bits
Computational Complexity | 1994-05-08 | Paper |
| scientific article; zbMATH DE number 503260 (Why is no real title available?) | 1994-03-07 | Paper |
Computing Frobenius maps and factoring polynomials
Computational Complexity | 1993-06-29 | Paper |
| Searching for Primitive Roots in Finite Fields | 1992-06-28 | Paper |
Smoothness and factoring polynomials over finite fields
Information Processing Letters | 1992-06-26 | Paper |
On the deterministic complexity of factoring polynomials over finite fields
Information Processing Letters | 1990-01-01 | Paper |
| New Algorithms for Finding Irreducible Polynomials Over Finite Fields | 1990-01-01 | Paper |
Factoring polynomials using fewer random bits
Journal of Symbolic Computation | 1990-01-01 | Paper |
