Ingrid Biehl

According to our database, Ingrid Biehl authored at least 15 papers between 1992 and 2004.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2004

Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders.

Ingrid Biehl, Sachar Paulus, Tsuyoshi Takagi

Des. Codes Cryptogr., 2004

2002

A Signature Scheme Based on the Intractability of Computing Roots.

Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer

Des. Codes Cryptogr., 2002

Cryptographic methods for collusion-secure fingerprinting of digital data.

Ingrid Biehl, Bernd Meyer

Comput. Electr. Eng., 2002

A New Distributed Primality Test for Shared RSA Keys Using Quadratic Fields.

Ingrid Biehl, Tsuyoshi Takagi

Proceedings of the Information Security and Privacy, 7th Australian Conference, 2002

2000

Differential Fault Attacks on Elliptic Curve Cryptosystems.

Ingrid Biehl, Bernd Meyer, Volker Müller

Proceedings of the Advances in Cryptology, 2000

1999

Effizienzverbesserungen durch schlüssel-optimierte Ver- und Entschlüsselung in Workstations.

Ingrid Biehl, Jörg Keller

Proceedings of the Architektur von Rechensystemen, Systemarchitektur auf dem Weg ins 3. Jahrtausend: Neue Strukturen, Konzepte, Verfahren und Bewertungsmethoden, 1999

1998

Ensuring the Integrity of Agent-Based Computations by Short Proofs.

Ingrid Biehl, Bernd Meyer, Susanne Wetzel

Proceedings of the Mobile Agents, Second International Workshop, 1998

Visual Cryptography - How to Use Images to Share a Secret.

Ingrid Biehl, Bernd Meyer, Susanne Wetzel

Proceedings of the Informatik '98, 1998

1997

Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract).

Ingrid Biehl, Bernd Meyer

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Traceable visual cryptography.

Ingrid Biehl, Susanne Wetzel

Proceedings of the Information and Communication Security, First International Conference, 1997

1996

Cryptographic Protocols Based on Real-Quadratic A-fields.

Ingrid Biehl, Bernd Meyer, Christoph Thiel

Proceedings of the Advances in Cryptology, 1996

1994

Definition and Existence of Super Complexity Cores.

Ingrid Biehl

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders.

Ingrid Biehl, Johannes A. Buchmann, Christoph Thiel

Proceedings of the Advances in Cryptology, 1994

1993

Eine Grundlegung der Average-case Komplexitätstheorie.

Ingrid Biehl

PhD thesis, 1993

1992

Tools for Proving Zero Knowledge.

Ingrid Biehl, Johannes A. Buchmann, Bernd Meyer, Christian Thiel, Christoph Thiel

Proceedings of the Advances in Cryptology, 1992