- Appears in Cryptography and Coding: 10th IMA International Conference, Lecture Notes in Computer Science 3796 (2005) 355375. Springer-Verlag. Concrete Security of the Blum-Blum-Shub
- Appears in Information Security (ISC 2007), Lecture Notes in Computer Science 4779 (2007) 130144. Springer-Verlag. Efficient Committed Oblivious Transfer
- Appears as CWI Report CS-R9504, January 1995. A New Algorithm for the Recognition of Series
- Appears in Cryptographers' Track-RSA Conference (CT-RSA 2008), Lecture Notes in Computer Science 4964 (2008) 88105. Springer-Verlag. An Efficient Protocol for
- Stellingen behorende bij het proefschrift Data Structures and Amortized Complexity in a Functional Setting
- Appears in Mathematics of Program Construction-MPC'92, Lecture Notes in Computer Science 669, pp. 291301, 1993. Springer-Verlag. Inorder Traversal of a Binary Heap and its Inversion in
- Data Structures Amortized Complexity
- In Proc. of the 10th Conference on Computers, Freedom and Privacy, Toronto, Canada, April 47, 2000, pp. 231233. ACM, New York. Compensating for a Lack of Transparency
- CoercionCoercion--Resistant RemoteResistant Remote Voting Using Decryption MixesVoting Using Decryption Mixes
- Information Processing Letters 37 (1991) 265--271 The derivation of a tighter bound for topdown skew
- Centr um voor Wi skunde en I nf or mati ca Modelling, AnalysisandSimulation
- Data Structures Amortized Complexity
- In Public Key Cryptography--PKC '07, Vol. 4450 of Lecture Notes in Computer Science, Springer-Verlag, 2007. pp. 426-441. Efficient Pseudorandom Generators Based on
- In Public Key Cryptography--PKC '07, Vol. 4450 of Lecture Notes in Computer Science, Springer-Verlag, 2007. pp. 330-342. Practical and Secure Solutions
- In proceedings of PKC2000, Vol. 1751 of Lecture Notes in Computer Science, Springer-Verlag, 2000. pp. 293-305. Optimally Efficient Accountable Time-Stamping
- Appears as CWI Report CS-R9571, November 1995. Multi-Authority Secret-Ballot Elections with Linear Work
- Appears as CWI Report CS-R9413, February 1994. Proofs of Partial Knowledge and Simplified Design of
- Data Structures Amortized Complexity
- Science of Computer Programming 14 (1990) 243--254 Searching by Elimination
- Recognizing PerfectShuffles JoostPieter Katoen Berry Schoenmakers
- A Tight Lower Bound for Top-Down Skew Heaps Berry Schoenmakers
- In Discrete Applied Mathematics, 111 (2001) 2336. (Special issue on coding and cryptology) A Fair and Efficient Solution to the Socialist
- In Advances in Cryptology--CRYPTO '94, Vol. 839 of Lecture Notes in Computer Science, Springer-Verlag, 1994. pp. 174-187. Proofs of Partial Knowledge and Simplified
- Appears in Proceedings of IEEE International Symposium on Information Theory-ISIT (2005) 15981602. IEEE. Quantum Information Theoretical Analysis of
- Appears in Cryptographic Hardware and Embedded Systems--CHES 2005, Lecture Notes in Computer Science 3659 (2005) 293308. Springer-Verlag. On Second-Order Differential Power Analysis
- In Advances in Cryptology--EUROCRYPT'96, Vol. 1070 of Lecture Notes in Computer Science, Springer-Verlag, 1996. pp. 72-83. Multi-Authority Secret-Ballot Elections with
- In Information Processing Letters 45 (1993) 4150. A Systematic Analysis of Splaying
- To appear in ALGORITHMS AND THEORY OF COMPUTATION HANDBOOK (Second Edition), Mikhail Atallah and Marina Blanton (Eds.). CRC-Press. DRAFT BOOK CHAPTER
- Appears in Information Theoretic Security (ICITS'08), Lecture Notes in Computer Science 5155 (2008) 183198. Springer-Verlag. Revisiting the Karnin, Greene and Hellman
- To appear in Proceedings of IEEE International Symposium on Information Theory-ISIT (2007). Smooth Renyi Entropy of Ergodic Quantum
- Appears in Advances in Cryptology--EUROCRYPT 2006, Lecture Notes in Computer Science 4004 (2006) 522537. Springer-Verlag. Efficient Binary Conversion for Paillier
- Appears in Proceedings of 27th Symposium on Information Theory in the Benelux (2006) 283290. A Protocol Issue for
- Appears in Discrete Applied Mathematics 154 (2006) 189201. Elsevier. List Signature Schemes
- APPEARS IN PROCEEDINGS OF 26TH SYMPOSIUM ON INFORMATION THEORY IN THE BENELUX (2005) 181188. QUANTUM INFORMATION THEORETICAL ANALYSIS OF
- Appears in Proceedings of IEEE International Symposium on Information Theory-ISIT (2005) 16121616. IEEE. Generic Security Proof of Quantum Key Exchange
- APPEARS IN PROCEEDINGS OF 26TH SYMPOSIUM ON INFORMATION THEORY IN THE BENELUX (2005) 189196. GENERIC SECURITY PROOF OF QUANTUM KEY
- Appears in WEWoRC 2005 -Western European Workshop on Research in Cryptology, Lecture Notes in Informatics (LNI) P-74 (2005) 53-63. Gesellschaft fur Informatik. State Recovery Attacks on Pseudorandom Generators
- Appears in Advances in Cryptology--ASIACRYPT 2004, Lecture Notes in Computer Science 3329 (2004) 119136. Springer-Verlag. Practical Two-Party Computation based on the
- In Advances in Cryptology--CRYPTO '99, Vol. 1666 of Lecture Notes in Computer Science, Springer-Verlag, 1999. pp. 148-164. A Simple Publicly Verifiable Secret Sharing
- In European Transactions on Telecommunications 8(5) (September-October 1997) 481490. A Secure and Optimally Efficient Multi-Authority Election
- Appears as CWI Report CS-R9522, March 1995. An Efficient Electronic Payment System Withstanding
- Appears in Science of Computer Programming 27 (1996) 119-137. Systolic Arrays for the Recognition
- Voter-Verifiability through Independent Electronic Verification Modules
- Appears in Secure Data Management: Second VLDB Workshop--SDM 2005, Lecture Notes in Computer Science 3674 (2005) 3346. Springer-Verlag. Experiments With Queries Over Encrypted
- Data Structures Amortized Complexity
