default search action
Berry Schoenmakers
Person information
- affiliation: Eindhoven University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]Stan Korzilius
, Berry Schoenmakers
Divisions and Square Roots with Tight Error Analysis from Newton-Raphson Iteration in Secure Fixed-Point Arithmetic. Cryptogr. 7(3): 43 (2023) - [j14]Berry Schoenmakers
Secure Groups for Threshold Cryptography and Number-Theoretic Multiparty Computation. Cryptogr. 7(4): 56 (2023) - [c37]Berry Schoenmakers, Toon Segers:
Efficient Extended GCD and Class Groups from Secure Integer Arithmetic. CSCML 2023: 32-48 - [c36]Stan Korzilius, Berry Schoenmakers:
New Approach for Sine and Cosine in Secure Fixed-Point Arithmetic. CSCML 2023: 307-319 - 2021
- [c35]Frank Blom, Niek J. Bouman, Berry Schoenmakers, Niels de Vreede:
Efficient Secure Ridge Regression from Randomized Gaussian Elimination. CSCML 2021: 301-316
2010 – 2019
- 2019
- [j13]Xinxin Fan, Guang Gong, Berry Schoenmakers, Francesco Sica
Secure simultaneous bit extraction from Koblitz curves. Des. Codes Cryptogr. 87(1): 1-13 (2019) - [c34]Mark Abspoel, Niek J. Bouman, Berry Schoenmakers, Niels de Vreede:
Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks. CT-RSA 2019: 453-472 - [i13]Frank Blom, Niek J. Bouman, Berry Schoenmakers, Niels de Vreede:
Efficient Secure Ridge Regression from Randomized Gaussian Elimination. IACR Cryptol. ePrint Arch. 2019: 773 (2019) - 2018
- [i12]Berry Schoenmakers:
Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains. CoRR abs/1802.03748 (2018) - [i11]Mark Abspoel, Niek J. Bouman, Berry Schoenmakers, Niels de Vreede:
Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks. IACR Cryptol. ePrint Arch. 2018: 1236 (2018) - 2016
- [c33]Berry Schoenmakers, Meilof Veeningen, Niels de Vreede:
Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation. ACNS 2016: 346-366 - [c32]Sebastiaan de Hoogh, Berry Schoenmakers, Meilof Veeningen:
Certificate Validation in Secure Computation and Its Use in Verifiable Linear Programming. AFRICACRYPT 2016: 265-284 - [c31]Berry Schoenmakers:
Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal. Financial Cryptography 2016: 299-320 - [i10]Oscar García Morchon, Ronald Rietman, Ludo Tolhuizen, Jose Luis Torre-Arce, Moon Sung Lee, Domingo Gómez-Pérez, Jaime Gutierrez, Berry Schoenmakers:
Attacks and parameter choices in HIMMO. IACR Cryptol. ePrint Arch. 2016: 152 (2016) - 2015
- [c30]Berry Schoenmakers, Meilof Veeningen:
Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems. ACNS 2015: 3-22 - [i9]Berry Schoenmakers, Meilof Veeningen:
Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems. IACR Cryptol. ePrint Arch. 2015: 58 (2015) - [i8]Berry Schoenmakers, Meilof Veeningen:
Guaranteeing Correctness in Privacy-Friendly Outsourcing by Certificate Validation. IACR Cryptol. ePrint Arch. 2015: 339 (2015) - [i7]Berry Schoenmakers, Meilof Veeningen, Niels de Vreede:
Trinocchio: Privacy-Friendly Outsourcing by Distributed Verifiable Computation. IACR Cryptol. ePrint Arch. 2015: 480 (2015) - 2014
- [c29]Sebastiaan de Hoogh, Berry Schoenmakers, Ping Chen, Harm op den Akker
Practical Secure Decision Tree Learning in a Teletreatment Application. Financial Cryptography 2014: 179-194 - [i6]Berry Schoenmakers:
Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal. IACR Cryptol. ePrint Arch. 2014: 329 (2014) - 2012
- [j12]Reza Sepahi, Josef Pieprzyk
New security notions and relations for public-key encryption. J. Math. Cryptol. 6(3-4): 183-227 (2012) - 2011
- [j11]Florian Kerschbaum, Axel Schröpfer, Antonio Zilli, Richard Pibernik, Octavian Catrina
Secure Collaborative Supply-Chain Management. Computer 44(9): 38-43 (2011) - [j10]Boris Skoric, Chibuzo Obi, Evgeny A. Verbitskiy
Sharp lower bounds on the extractable randomness from non-uniform sources. Inf. Comput. 209(8): 1184-1196 (2011) - [r23]Berry Schoenmakers:
Designated-Verifier Proofs. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 330-331 - [r22]Berry Schoenmakers:
Homomorphic Encryption. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 560-562 - [r21]Berry Schoenmakers:
Interactive Argument. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 618-619 - [r20]Berry Schoenmakers:
Interactive Proof. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 619 - [r19]Berry Schoenmakers:
Multiparty Computation. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 812-815 - [r18]Berry Schoenmakers:
Noninteractive Proof. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 846 - [r17]Berry Schoenmakers:
Oblivious Transfer. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 884-885 - [r16]Berry Schoenmakers:
Proof of Knowledge Versus Proof of Membership. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 983-984 - [r15]Berry Schoenmakers:
Protocol. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 990 - [r14]Berry Schoenmakers:
Threshold Homomorphic Cryptosystems. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1293-1294 - [r13]Berry Schoenmakers:
Verifiable Secret Sharing. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1357-1358 - [r12]Berry Schoenmakers:
Witness Hiding. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1391-1392 - [r11]Berry Schoenmakers:
Zero-Knowledge. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1401-1403 - 2010
- [j9]Evgeny A. Verbitskiy
Key extraction from general nondiscrete signals. IEEE Trans. Inf. Forensics Secur. 5(2): 269-279 (2010) - [c28]Jorge Guajardo, Bart Mennink, Berry Schoenmakers:
Anonymous Credential Schemes with Encrypted Attributes. CANS 2010: 314-333 - [c27]Jorge Guajardo, Bart Mennink, Berry Schoenmakers:
Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis. Financial Cryptography 2010: 375-382
2000 – 2009
- 2009
- [c26]Sebastiaan de Hoogh, Berry Schoenmakers, Boris Skoric, José Villegas:
Verifiable Rotation of Homomorphic Encryptions. Public Key Cryptography 2009: 393-410 - [e1]Peter Y. A. Ryan, Berry Schoenmakers:
E-Voting and Identity, Second International Conference, VoteID 2009, Luxembourg, September 7-8, 2009. Proceedings. Lecture Notes in Computer Science 5767, Springer 2009, ISBN 978-3-642-04134-1 [contents] - [i5]Evgeny A. Verbitskiy, Pim Tuyls, Chibuzo Obi, Berry Schoenmakers, Boris Skoric:
Key extraction from general non-discrete signals. IACR Cryptol. ePrint Arch. 2009: 303 (2009) - 2008
- [c25]Mehmet S. Kiraz
An Efficient Protocol for Fair Secure Two-Party Computation. CT-RSA 2008: 88-105 - [c24]Yvo Desmedt, Brian King, Berry Schoenmakers:
Revisiting the Karnin, Greene and Hellman Bounds. ICITS 2008: 183-198 - [i4]Boris Skoric, Chibuzo Obi, Evgeny A. Verbitskiy, Berry Schoenmakers:
Sharp lower bounds on the extractable randomness from non-uniform sources. IACR Cryptol. ePrint Arch. 2008: 484 (2008) - 2007
- [c23]Berry Schoenmakers, Jilles Tjoelker, Pim Tuyls, Evgeny A. Verbitskiy
Smooth R??nyi Entropy of Ergodic Quantum Information Sources. ISIT 2007: 256-260 - [c22]Mehmet S. Kiraz
Efficient Committed Oblivious Transfer of Bit Strings. ISC 2007: 130-144 - [c21]Juan A. Garay, Berry Schoenmakers, José Villegas:
Practical and Secure Solutions for Integer Comparison. Public Key Cryptography 2007: 330-342 - [c20]Reza Rezaeian Farashahi, Berry Schoenmakers, Andrey Sidorenko:
Efficient Pseudorandom Generators Based on the DDH Assumption. Public Key Cryptography 2007: 426-441 - [p1]Berry Schoenmakers, Pim Tuyls:
Client-Server Trade-Offs in Secure Computation. Security, Privacy, and Trust in Modern Data Management 2007: 197-211 - [i3]Berry Schoenmakers, Jilles Tjoelker, Pim Tuyls, Evgeny A. Verbitskiy:
Smooth Rényi Entropy of Ergodic Quantum Information Sources. CoRR abs/0704.3504 (2007) - 2006
- [j8]Sébastien Canard, Berry Schoenmakers, Martijn Stam, Jacques Traoré:
List signature schemes. Discret. Appl. Math. 154(2): 189-201 (2006) - [c19]Berry Schoenmakers, Pim Tuyls:
Efficient Binary Conversion for Paillier Encrypted Values. EUROCRYPT 2006: 522-537 - [i2]Berry Schoenmakers, Andrey Sidorenko:
Cryptanalysis of the Dual Elliptic Curve Pseudorandom Generator. IACR Cryptol. ePrint Arch. 2006: 190 (2006) - [i1]Reza Rezaeian Farashahi, Berry Schoenmakers, Andrey Sidorenko:
Efficient Pseudorandom Generators Based on the DDH Assumption. IACR Cryptol. ePrint Arch. 2006: 321 (2006) - 2005
- [c18]Marc Joye, Pascal Paillier, Berry Schoenmakers:
On Second-Order Differential Power Analysis. CHES 2005: 293-308 - [c17]Andrey Sidorenko, Berry Schoenmakers:
Concrete Security of the Blum-Blum-Shub Pseudorandom Generator. IMACC 2005: 355-375 - [c16]Karin Rietjens, Berry Schoenmakers, Pim Tuyls:
Quantum information theoretical analysis of various constructions for quantum secret sharing. ISIT 2005: 1598-1602 - [c15]Karin Poels, Pim Tuyls, Berry Schoenmakers:
Generic security proof of quantum key exchange using squeezed states. ISIT 2005: 1612-1616 - [c14]Richard Brinkman, Berry Schoenmakers, Jeroen Doumen, Willem Jonker:
Experiments with Queries over Encrypted Data Using Secret Sharing. Secure Data Management 2005: 33-46 - [c13]Andrey Sidorenko, Berry Schoenmakers:
State Recovery Attacks on Pseudorandom Generators. WEWoRC 2005: 53-63 - [r10]Berry Schoenmakers:
Interactive Argument. Encyclopedia of Cryptography and Security 2005 - [r9]Berry Schoenmakers:
Interactive Proof. Encyclopedia of Cryptography and Security 2005 - [r8]Berry Schoenmakers:
Multiparty Computation. Encyclopedia of Cryptography and Security 2005 - [r7]Berry Schoenmakers:
Noninteractive Proof. Encyclopedia of Cryptography and Security 2005 - [r6]Berry Schoenmakers:
Oblivious Transfer. Encyclopedia of Cryptography and Security 2005 - [r5]Berry Schoenmakers:
Proof of Knowledge vs. Proof of Membership. Encyclopedia of Cryptography and Security 2005 - [r4]Berry Schoenmakers:
Protocol. Encyclopedia of Cryptography and Security 2005 - [r3]Berry Schoenmakers:
Verifiable Secret Sharing. Encyclopedia of Cryptography and Security 2005 - [r2]Berry Schoenmakers:
Witness Hiding. Encyclopedia of Cryptography and Security 2005 - [r1]Berry Schoenmakers:
Zero-knowledge. Encyclopedia of Cryptography and Security 2005 - 2004
- [c12]Berry Schoenmakers, Pim Tuyls:
Practical Two-Party Computation Based on the Conditional Gate. ASIACRYPT 2004: 119-136 - 2001
- [j7]Fabrice Boudot, Berry Schoenmakers, Jacques Traoré:
A fair and efficient solution to the socialist millionaires' problem. Discret. Appl. Math. 111(1-2): 23-36 (2001) - 2000
- [c11]Berry Schoenmakers:
Compensating for a lack of transparency. CFP 2000: 231-233 - [c10]Ahto Buldas, Helger Lipmaa, Berry Schoenmakers:
Optimally Efficient Accountable Time-Stamping. Public Key Cryptography 2000: 293-305
1990 – 1999
- 1999
- [c9]Berry Schoenmakers:
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic. CRYPTO 1999: 148-164 - 1997
- [j6]Ronald Cramer, Rosario Gennaro, Berry Schoenmakers:
A secure and optimally efficient multi-authority election scheme. Eur. Trans. Telecommun. 8(5): 481-490 (1997) - [j5]Berry Schoenmakers:
A Tight Lower Bound for Top-Down Skew Heaps. Inf. Process. Lett. 61(5): 279-284 (1997) - [c8]Berry Schoenmakers:
Security Aspects of the EcashTM Payment System. State of the Art in Applied Cryptography 1997: 338-352 - [c7]Ronald Cramer, Rosario Gennaro, Berry Schoenmakers:
A Secure and Optimally Efficient Multi-Authority Election Scheme. EUROCRYPT 1997: 103-118 - 1996
- [j4]Joost-Pieter Katoen
Systolic Arrays for the Recognition of Permutation-Invariant Segments. Sci. Comput. Program. 27(2): 119-137 (1996) - [c6]Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers, Moti Yung:
Multi-Autority Secret-Ballot Elections with Linear Work. EUROCRYPT 1996: 72-83 - 1994
- [c5]Ronald Cramer, Ivan Damgård, Berry Schoenmakers:
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. CRYPTO 1994: 174-187 - [c4]Jean-Paul Boly, Antoon Bosselaers, Ronald Cramer, Rolf Michelsen, Stig Fr. Mjølsnes
The ESPRIT Project CAFE - High Security Digital Payment Systems. ESORICS 1994: 217-230 - 1993
- [j3]Berry Schoenmakers:
A Systematic Analysis of Splaying. Inf. Process. Lett. 45(1): 41-50 (1993) - 1992
- [c3]Berry Schoenmakers:
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space. MPC 1992: 291-301 - 1991
- [j2]Anne Kaldewaij, Berry Schoenmakers:
The Derivation of a Tighter Bound for Top-Down Skew Heaps. Inf. Process. Lett. 37(5): 265-271 (1991) - [c2]Joost-Pieter Katoen, Berry Schoenmakers:
A Parallel program for the recognition of P-Invariant segments. Algorithms and Parallel VLSI Architectures 1991: 79-84 - 1990
- [j1]Anne Kaldewaij, Berry Schoenmakers:
Searching by Elimination. Sci. Comput. Program. 14(2-3): 243-254 (1990)
1980 – 1989
- 1989
- [c1]Anne Kaldewaij, Berry Schoenmakers:
Searching by Elimination. MPC 1989: 297-306
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: