Ingrid Biehl

15 papers A* 3A 2B 1C 1Misc 1Journal 3Unranked 3
YearRankTypeTitle / Venue / Authors
2004 J jnl
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders.
Des. Codes Cryptogr.
Ingrid Biehl, Sachar Paulus, Tsuyoshi Takagi
2002 Misc conf
A New Distributed Primality Test for Shared RSA Keys Using Quadratic Fields.
ACISP
Ingrid Biehl, Tsuyoshi Takagi
2002 J jnl
A Signature Scheme Based on the Intractability of Computing Roots.
Des. Codes Cryptogr.
Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer
2002 J jnl
Cryptographic methods for collusion-secure fingerprinting of digital data.
Comput. Electr. Eng.
Ingrid Biehl, Bernd Meyer
2000 A* conf
Differential Fault Attacks on Elliptic Curve Cryptosystems.
CRYPTO
Ingrid Biehl, Bernd Meyer, Volker Müller
1999 — conf
Effizienzverbesserungen durch schlüssel-optimierte Ver- und Entschlüsselung in Workstations.
ARCS
Ingrid Biehl, Jörg Keller
1998 — conf
Ensuring the Integrity of Agent-Based Computations by Short Proofs.
Mobile Agents
Ingrid Biehl, Bernd Meyer, Susanne Wetzel
1998 — conf
Visual Cryptography - How to Use Images to Share a Secret.
GI Jahrestagung
Ingrid Biehl, Bernd Meyer, Susanne Wetzel
1997 A conf
Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract).
STACS
Ingrid Biehl, Bernd Meyer
1997 C conf
Traceable visual cryptography.
ICICS
Ingrid Biehl, Susanne Wetzel
1996 A conf
Cryptographic Protocols Based on Real-Quadratic A-fields.
ASIACRYPT
Ingrid Biehl, Bernd Meyer, Christoph Thiel
1994 A* conf
Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders.
CRYPTO
Ingrid Biehl, Johannes A. Buchmann, Christoph Thiel
1994 B conf
Definition and Existence of Super Complexity Cores.
ISAAC
Ingrid Biehl
1993 — —
Eine Grundlegung der Average-case Komplexitätstheorie.
Ingrid Biehl
1992 A* conf
Tools for Proving Zero Knowledge.
EUROCRYPT
Ingrid Biehl, Johannes A. Buchmann, Bernd Meyer, Christian Thiel, Christoph Thiel