Tools for Proving Zero Knowledge. - Ingrid Biehl; Johannes A. Buchmann; Bernd Meyer 002; Christian Thiel 003; Christoph Thiel (EUROCRYPT, 1992)

Constructive Separation of Classes of Indistinguishable Ensembles. - Bernd Meyer 002 (SCT, 1994)

Zur Trennung von Klassen ununterscheidbarer Ensembles. - Bernd Meyer 002 (1995)

Cryptographic Protocols Based on Real-Quadratic A-fields. - Ingrid Biehl; Bernd Meyer 002; Christoph Thiel (ASIACRYPT, 1996)

A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring. - Bernd Meyer 002; Volker Müller 001 (EUROCRYPT, 1996)

Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract). - Ingrid Biehl; Bernd Meyer 002 (STACS, 1997)

Visual Cryptography - How to Use Images to Share a Secret. - Ingrid Biehl; Bernd Meyer 002; Susanne Wetzel (GI Jahrestagung, 1998)

Ensuring the Integrity of Agent-Based Computations by Short Proofs. - Ingrid Biehl; Bernd Meyer 002; Susanne Wetzel (Mobile Agents, 1998)

Differential Fault Attacks on Elliptic Curve Cryptosystems. - Ingrid Biehl; Bernd Meyer 002; Volker Müller 001 (CRYPTO, 2000)

Cryptographic methods for collusion-secure fingerprinting of digital data. - Ingrid Biehl; Bernd Meyer 002 (Comput. Electr. Eng., 2002)

Linking Anonymous Transactions: The Consistent View Attack. - Andreas Pashalidis; Bernd Meyer 002 (Privacy Enhancing Technologies, 2006)

Attacking Unlinkability: The Importance of Context. - Matthias Franz; Bernd Meyer 002; Andreas Pashalidis (Privacy Enhancing Technologies, 2007)

SPICE Simulation of a "Provably Secure" True Random Number Generator. - Markus Dichtl; Bernd Meyer 002; Hermann Seuschek (IACR Cryptol. ePrint Arch., 2008)