2009 |
39 | EE | Sebastiaan de Hoogh,
Berry Schoenmakers,
Boris Skoric,
José Villegas:
Verifiable Rotation of Homomorphic Encryptions.
Public Key Cryptography 2009: 393-410 |
2008 |
38 | EE | Mehmet S. Kiraz,
Berry Schoenmakers:
An Efficient Protocol for Fair Secure Two-Party Computation.
CT-RSA 2008: 88-105 |
37 | EE | Yvo Desmedt,
Brian King,
Berry Schoenmakers:
Revisiting the Karnin, Greene and Hellman Bounds.
ICITS 2008: 183-198 |
2007 |
36 | EE | Mehmet S. Kiraz,
Berry Schoenmakers,
José Villegas:
Efficient Committed Oblivious Transfer of Bit Strings.
ISC 2007: 130-144 |
35 | EE | Juan A. Garay,
Berry Schoenmakers,
José Villegas:
Practical and Secure Solutions for Integer Comparison.
Public Key Cryptography 2007: 330-342 |
34 | EE | Reza Rezaeian Farashahi,
Berry Schoenmakers,
Andrey Sidorenko:
Efficient Pseudorandom Generators Based on the DDH Assumption.
Public Key Cryptography 2007: 426-441 |
2006 |
33 | EE | Berry Schoenmakers,
Pim Tuyls:
Efficient Binary Conversion for Paillier Encrypted Values.
EUROCRYPT 2006: 522-537 |
32 | EE | Sébastien Canard,
Berry Schoenmakers,
Martijn Stam,
Jacques Traoré:
List signature schemes.
Discrete Applied Mathematics 154(2): 189-201 (2006) |
2005 |
31 | EE | Marc Joye,
Pascal Paillier,
Berry Schoenmakers:
On Second-Order Differential Power Analysis.
CHES 2005: 293-308 |
30 | EE | Andrey Sidorenko,
Berry Schoenmakers:
Concrete Security of the Blum-Blum-Shub Pseudorandom Generator.
IMA Int. Conf. 2005: 355-375 |
29 | EE | Richard Brinkman,
Berry Schoenmakers,
Jeroen Doumen,
Willem Jonker:
Experiments with Queries over Encrypted Data Using Secret Sharing.
Secure Data Management 2005: 33-46 |
28 | | Andrey Sidorenko,
Berry Schoenmakers:
State Recovery Attacks on Pseudorandom Generators.
WEWoRC 2005: 53-63 |
27 | EE | Berry Schoenmakers:
Interactive Argument.
Encyclopedia of Cryptography and Security 2005 |
26 | EE | Berry Schoenmakers:
Interactive Proof.
Encyclopedia of Cryptography and Security 2005 |
25 | EE | Berry Schoenmakers:
Multiparty Computation.
Encyclopedia of Cryptography and Security 2005 |
24 | EE | Berry Schoenmakers:
Noninteractive Proof.
Encyclopedia of Cryptography and Security 2005 |
23 | EE | Berry Schoenmakers:
Oblivious Transfer.
Encyclopedia of Cryptography and Security 2005 |
22 | EE | Berry Schoenmakers:
Proof of Knowledge vs. Proof of Membership.
Encyclopedia of Cryptography and Security 2005 |
21 | EE | Berry Schoenmakers:
Protocol.
Encyclopedia of Cryptography and Security 2005 |
20 | EE | Berry Schoenmakers:
Verifiable Secret Sharing.
Encyclopedia of Cryptography and Security 2005 |
19 | EE | Berry Schoenmakers:
Witness Hiding.
Encyclopedia of Cryptography and Security 2005 |
18 | EE | Berry Schoenmakers:
Zero-knowledge.
Encyclopedia of Cryptography and Security 2005 |
2004 |
17 | EE | Berry Schoenmakers,
Pim Tuyls:
Practical Two-Party Computation Based on the Conditional Gate.
ASIACRYPT 2004: 119-136 |
2001 |
16 | | Fabrice Boudot,
Berry Schoenmakers,
Jacques Traoré:
A fair and efficient solution to the socialist millionaires' problem.
Discrete Applied Mathematics 111(1-2): 23-36 (2001) |
2000 |
15 | | Ahto Buldas,
Helger Lipmaa,
Berry Schoenmakers:
Optimally Efficient Accountable Time-Stamping.
Public Key Cryptography 2000: 293-305 |
1999 |
14 | EE | Berry Schoenmakers:
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic.
CRYPTO 1999: 148-164 |
1997 |
13 | EE | Ronald Cramer,
Rosario Gennaro,
Berry Schoenmakers:
A Secure and Optimally Efficient Multi-Authority Election Scheme.
EUROCRYPT 1997: 103-118 |
12 | EE | Berry Schoenmakers:
Security Aspects of the Ecash Payment System.
State of the Art in Applied Cryptography 1997: 338-352 |
11 | EE | Berry Schoenmakers:
A Tight Lower Bound for Top-Down Skew Heaps.
Inf. Process. Lett. 61(5): 279-284 (1997) |
1996 |
10 | EE | Ronald Cramer,
Matthew K. Franklin,
Berry Schoenmakers,
Moti Yung:
Multi-Autority Secret-Ballot Elections with Linear Work.
EUROCRYPT 1996: 72-83 |
9 | | Joost-Pieter Katoen,
Berry Schoenmakers:
Systolic Arrays for the Recognition of Permutation-Invariant Segments.
Sci. Comput. Program. 27(2): 119-137 (1996) |
1994 |
8 | EE | Ronald Cramer,
Ivan Damgård,
Berry Schoenmakers:
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols.
CRYPTO 1994: 174-187 |
7 | EE | Jean-Paul Boly,
Antoon Bosselaers,
Ronald Cramer,
Rolf Michelsen,
Stig Fr. Mjølsnes,
Frank Muller,
Torben P. Pedersen,
Birgit Pfitzmann,
Peter de Rooij,
Berry Schoenmakers,
Matthias Schunter,
Luc Vallée,
Michael Waidner:
The ESPRIT Project CAFE - High Security Digital Payment Systems.
ESORICS 1994: 217-230 |
1993 |
6 | | Berry Schoenmakers:
A Systematic Analysis of Splaying.
Inf. Process. Lett. 45(1): 41-50 (1993) |
1992 |
5 | | Berry Schoenmakers:
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space.
MPC 1992: 291-301 |
1991 |
4 | | Joost-Pieter Katoen,
Berry Schoenmakers:
A Parallel program for the recognition of P-Invariant segments.
Algorithms and Parallel VLSI Architectures 1991: 79-84 |
3 | | Anne Kaldewaij,
Berry Schoenmakers:
The Derivation of a Tighter Bound for Top-Down Skew Heaps.
Inf. Process. Lett. 37(5): 265-271 (1991) |
1990 |
2 | | Anne Kaldewaij,
Berry Schoenmakers:
Searching by Elimination.
Sci. Comput. Program. 14(2-3): 243-254 (1990) |
1989 |
1 | | Anne Kaldewaij,
Berry Schoenmakers:
Searching by Elimination.
MPC 1989: 297-306 |