Berry Schoenmakers

According to our database1, Berry Schoenmakers authored at least 75 papers between 1989 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Efficient Secure Ridge Regression from Randomized Gaussian Elimination.
IACR Cryptology ePrint Archive, 2019

Secure simultaneous bit extraction from Koblitz curves.
Des. Codes Cryptogr., 2019

Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks.
Proceedings of the Topics in Cryptology - CT-RSA 2019, 2019

2016
Attacks and parameter choices in HIMMO.
IACR Cryptology ePrint Archive, 2016

Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal.
Proceedings of the Financial Cryptography and Data Security, 2016

Certificate Validation in Secure Computation and Its Use in Verifiable Linear Programming.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2016, 2016

Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation.
Proceedings of the Applied Cryptography and Network Security, 2016

2015
Trinocchio: Privacy-Friendly Outsourcing by Distributed Verifiable Computation.
IACR Cryptology ePrint Archive, 2015

Guaranteeing Correctness in Privacy-Friendly Outsourcing by Certificate Validation.
IACR Cryptology ePrint Archive, 2015

Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems.
Proceedings of the Applied Cryptography and Network Security, 2015

2014
Practical Secure Decision Tree Learning in a Teletreatment Application.
Proceedings of the Financial Cryptography and Data Security, 2014

2012
New security notions and relations for public-key encryption.
J. Mathematical Cryptology, 2012

2011
Zero-Knowledge.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Witness Hiding.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Verifiable Secret Sharing.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Threshold Homomorphic Cryptosystems.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Protocol.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Proof of Knowledge Versus Proof of Membership.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Oblivious Transfer.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Noninteractive Proof.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Multiparty Computation.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Interactive Proof.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Interactive Argument.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Homomorphic Encryption.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Designated-Verifier Proofs.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Sharp lower bounds on the extractable randomness from non-uniform sources.
Inf. Comput., 2011

Secure Collaborative Supply-Chain Management.
IEEE Computer, 2011

2010
Key extraction from general nondiscrete signals.
IEEE Trans. Information Forensics and Security, 2010

Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis.
Proceedings of the Financial Cryptography and Data Security, 14th International Conference, 2010

Anonymous Credential Schemes with Encrypted Attributes.
Proceedings of the Cryptology and Network Security - 9th International Conference, 2010

2009
Key extraction from general non-discrete signals.
IACR Cryptology ePrint Archive, 2009

Verifiable Rotation of Homomorphic Encryptions.
Proceedings of the Public Key Cryptography, 2009

2008
Sharp lower bounds on the extractable randomness from non-uniform sources.
IACR Cryptology ePrint Archive, 2008

Revisiting the Karnin, Greene and Hellman Bounds.
Proceedings of the Information Theoretic Security, Third International Conference, 2008

An Efficient Protocol for Fair Secure Two-Party Computation.
Proceedings of the Topics in Cryptology, 2008

2007
Practical and Secure Solutions for Integer Comparison.
Proceedings of the Public Key Cryptography, 2007

Efficient Pseudorandom Generators Based on the DDH Assumption.
Proceedings of the Public Key Cryptography, 2007

Efficient Committed Oblivious Transfer of Bit Strings.
Proceedings of the Information Security, 10th International Conference, 2007

Smooth R??nyi Entropy of Ergodic Quantum Information Sources.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Client-Server Trade-Offs in Secure Computation.
Proceedings of the Security, Privacy, and Trust in Modern Data Management, 2007

2006
Cryptanalysis of the Dual Elliptic Curve Pseudorandom Generator.
IACR Cryptology ePrint Archive, 2006

List signature schemes.
Discrete Applied Mathematics, 2006

Efficient Binary Conversion for Paillier Encrypted Values.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

2005
Zero-knowledge.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Witness Hiding.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Verifiable Secret Sharing.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Protocol.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Proof of Knowledge vs. Proof of Membership.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Oblivious Transfer.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Noninteractive Proof.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Multiparty Computation.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Interactive Proof.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Interactive Argument.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

State Recovery Attacks on Pseudorandom Generators.
Proceedings of the WEWoRC 2005, 2005

Experiments with Queries over Encrypted Data Using Secret Sharing.
Proceedings of the Secure Data Management, 2005

Quantum information theoretical analysis of various constructions for quantum secret sharing.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Generic security proof of quantum key exchange using squeezed states.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Concrete Security of the Blum-Blum-Shub Pseudorandom Generator.
Proceedings of the Cryptography and Coding, 2005

On Second-Order Differential Power Analysis.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop, Edinburgh, UK, August 29, 2005

2004
Practical Two-Party Computation Based on the Conditional Gate.
Proceedings of the Advances in Cryptology, 2004

2001
A fair and efficient solution to the socialist millionaires' problem.
Discrete Applied Mathematics, 2001

2000
Optimally Efficient Accountable Time-Stamping.
Proceedings of the Public Key Cryptography, 2000

1999
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic.
Proceedings of the Advances in Cryptology, 1999

1997
A Tight Lower Bound for Top-Down Skew Heaps.
Inf. Process. Lett., 1997

A Secure and Optimally Efficient Multi-Authority Election Scheme.
Proceedings of the Advances in Cryptology, 1997

Security Aspects of the EcashTM Payment System.
Proceedings of the State of the Art in Applied Cryptography, 1997

1996
Systolic Arrays for the Recognition of Permutation-Invariant Segments.
Sci. Comput. Program., 1996

Multi-Autority Secret-Ballot Elections with Linear Work.
Proceedings of the Advances in Cryptology, 1996

1994
The ESPRIT Project CAFE - High Security Digital Payment Systems.
Proceedings of the Computer Security, 1994

Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols.
Proceedings of the Advances in Cryptology, 1994

1993
A Systematic Analysis of Splaying.
Inf. Process. Lett., 1993

1992
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space.
Proceedings of the Mathematics of Program Construction, Second International Conference, Oxford, UK, June 29, 1992

1991
The Derivation of a Tighter Bound for Top-Down Skew Heaps.
Inf. Process. Lett., 1991

A Parallel program for the recognition of P-Invariant segments.
Proceedings of the Algorithms and Parallel VLSI Architectures II, 1991

1989
Searching by Elimination.
Proceedings of the Mathematics of Program Construction, 1989


  Loading...