Victor Shoup

IACR Cryptol. ePrint Arch., 2020

Design and implementation of HElib: a homomorphic encryption library.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Security Analysis of itSPAKE2+.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019

An Improved RNS Variant of the BFV Homomorphic Encryption Scheme.

[BibT_eX]

[DOI]

Yuriy Polyakov

Proceedings of the Topics in Cryptology - CT-RSA 2019, 2019

2018

Faster Homomorphic Linear Transformations in HElib.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Doing Real Work with FHE: The Case of Logistic Regression.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2018

2017

Implementing BP-Obfuscation Using Graph-Induced Encoding.

[BibT_eX]

[DOI]

Tzipora Halevi

Noah Stephens-Davidowitz

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2015

Bootstrapping for HElib.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014

Algorithms in HElib.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

Practical Chosen Ciphertext Secure Encryption from Factoring.

[BibT_eX]

[DOI]

Dennis Hofheinz

Eike Kiltz

J. Cryptol., 2013

Practical and Employable Protocols for UC-Secure Circuit Evaluation over Z<sub>n</sub>.

[BibT_eX]

[DOI]

Robert R. Enderlein

IACR Cryptol. ePrint Arch., 2013

Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn.

[BibT_eX]

[DOI]

Robert R. Enderlein

Proceedings of the Computer Security - ESORICS 2013, 2013

2011

GNUC: A New Universal Composability Framework.

[BibT_eX]

[DOI]

Dennis Hofheinz

IACR Cryptol. ePrint Arch., 2011

A Framework for Practical Universally Composable Zero-Knowledge Protocols.

[BibT_eX]

[DOI]

Stephan Krenn

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack.

[BibT_eX]

[DOI]

J. Cryptol., 2010

Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model.

[BibT_eX]

[DOI]

Kristiyan Haralambiev

Tibor Jager

Eike Kiltz

Proceedings of the Public Key Cryptography, 2010

Credential Authenticated Identification and Key Exchange.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2010

2009

A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks.

[BibT_eX]

[DOI]

Nishanth Chandran

Proceedings of the Advances in Cryptology, 2009

Anonymous credentials on a standard java card.

[BibT_eX]

[DOI]

Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

2008

The Twin Diffie-Hellman Problem and Applications.

[BibT_eX]

[DOI]

David Cash

Eike Kiltz

Proceedings of the Advances in Cryptology, 2008

Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Yevgeniy Dodis

Shabsi Walfish

Proceedings of the Advances in Cryptology, 2008

2006

Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation.

[BibT_eX]

[DOI]

Mihir Bellare

Tadayoshi Kohno

Proceedings of the 13th ACM Conference on Computer and Communications Security, 2006

A computational introduction to number theory and algebra.

[BibT_eX]

Cambridge University Press, ISBN: 978-0-521-85154-1, 2006

2005

Optimistic Asynchronous Atomic Broadcast.

[BibT_eX]

[DOI]

Klaus Kursawe

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Sequences of games: a tool for taming complexity in security proofs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

A Note on An Encryption Scheme of Kurosawa and Desmedt.

[BibT_eX]

[DOI]

Rosario Gennaro

IACR Cryptol. ePrint Arch., 2004

Anonymous Identification in Ad Hoc Groups.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2004

2003

Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

A Secure Signature Scheme from Bilinear Maps.

[BibT_eX]

[DOI]

Dan Boneh

Ilya Mironov

Proceedings of the Topics in Cryptology, 2003

Practical Verifiable Encryption and Decryption of Discrete Logarithms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

2002

Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products.

[BibT_eX]

[DOI]

Joy Algesheimer

Proceedings of the Advances in Cryptology, 2002

2001

A Proposal for an ISO Standard for Public Key Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

OAEP Reconsidered.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

Secure and Efficient Asynchronous Broadcast Protocols.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

2000

Algorithms for Exponentiation in Finite Fields.

[BibT_eX]

[DOI]

Shuhong Gao

Joachim von zur Gathen

Daniel Panario

J. Symb. Comput., 2000

Optimistic fair exchange of digital signatures.

[BibT_eX]

[DOI]

N. Asokan

Michael Waidner

IEEE J. Sel. Areas Commun., 2000

ACE: The Advanced Cryptographic Engine.

[BibT_eX]

[DOI]

Thomas Schweinberger

IACR Cryptol. ePrint Arch., 2000

Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography.

[BibT_eX]

[DOI]

Christian Cachin

Klaus Kursawe

IACR Cryptol. ePrint Arch., 2000

Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract).

[BibT_eX]

[DOI]

Christian Cachin

Klaus Kursawe

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Factorization in ***[<i>x</i>]: the searching phase.

[BibT_eX]

[DOI]

John Abbott

Paul Zimmermann

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

A Composition Theorem for Universal One-Way Hash Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2000

Using Hash Functions as a Hedge against Chosen Ciphertext Attack.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2000

Practical Threshold Signatures.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2000

1999

On Formal Models for Secure Key Exchange.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1999

Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

Signature Schemes Based on the Strong RSA Assumption.

[BibT_eX]

[DOI]

Proceedings of the CCS '99, 1999

1998

Asynchronous Protocols for Optimistic Fair Exchange.

[BibT_eX]

[DOI]

N. Asokan

Michael Waidner

Proceedings of the Security and Privacy, 1998

Securing Threshold Cryptosystems against Chosen Ciphertext Attack.

[BibT_eX]

[DOI]

Rosario Gennaro

Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

Optimistic Fair Exchange of Digital Signatures (Extended Abstract).

[BibT_eX]

[DOI]

N. Asokan

Michael Waidner

Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1998

1997

Private Information Storage (Extended Abstract).

[BibT_eX]

[DOI]

Rafail Ostrovsky

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields.

[BibT_eX]

[DOI]

Erich L. Kaltofen

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Lower Bounds for Discrete Logarithms and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1997

1996

Private Information Storage.

[BibT_eX]

[DOI]

Rafail Ostrovsky

IACR Cryptol. ePrint Arch., 1996

Session Key Distribution Using Smart Cards.

[BibT_eX]

[DOI]

Aviel D. Rubin

Proceedings of the Advances in Cryptology, 1996

On the Security of a Practical Identification Scheme.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1996

On Fast and Provably Secure Message Authentication Based on Universal Hashing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1996

1995

A New Polynomial Factorization Algorithm and its Implementation.

[BibT_eX]

[DOI]

J. Symb. Comput., 1995

Subquadratic-time factoring of polynomials over finite fields.

[BibT_eX]

[DOI]

Erich L. Kaltofen

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

Counting the number of points on elliptic curves over finite fields of characteristic greater than three.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993

Primality Testing with Fewer Random Bits.

[BibT_eX]

[DOI]

René Peralta

Comput. Complex., 1993

Fast Construction of Irreducible Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992

Computing Frobenius Maps and Factoring Polynomials.

[BibT_eX]

[DOI]

Joachim von zur Gathen

Comput. Complex., 1992

Computing Frobenius Maps and Factoring Polynomials (Extended Abstract)

[BibT_eX]

[DOI]

Joachim von zur Gathen

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

Smoothness and Factoring Polynomials Over Finite Fields.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis

[BibT_eX]

[DOI]

Johannes A. Buchmann

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

A Fast Deterministic Algorithm for Factoring Polynomials over Finite Fields of Small Characteristic.

[BibT_eX]

[DOI]

Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

Lower Bounds for Polynomial Evaluation and Interpolation Problems

[BibT_eX]

[DOI]

Roman Smolensky

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Factoring Polynomials Using Fewer Random Bits.

[BibT_eX]

[DOI]

Eric Bach

J. Symb. Comput., 1990

On the Deterministic Complexity of Factoring Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Searching for Primitive Roots in Finite Fields

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract).

[BibT_eX]

[DOI]

Donald Beaver

Joan Feigenbaum

Proceedings of the Advances in Cryptology, 1990

1988

New Algorithms for Finding Irreducible Polynomials over Finite Fields

[BibT_eX]

[DOI]