TU Darmstadt / ULB / TUbiblio

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: No Grouping | Item Type | Date | Language
Number of items: 16.

Biehl, Ingrid and Paulus, Sachar and Takagi, Tsuyoshi (2004):
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders.
In: >IJDCC: Designs, Codes and Cryptography, pp. 99-123, 31, (2), [Article]

Biehl, Ingrid and Buchmann, Johannes and Hamdy, Safuat and Meyer, Andreas (2002):
A Signature Scheme Based on the Intractability of Computing Roots.
In: >Des. Codes Cryptography, pp. 223-236, 25, (3), [Article]

Biehl, Ingrid and Buchmann, Johannes and Hamdy, Safuat and Meyer, Andreas (2000):
A Signature Scheme Based on the Intractability of Computing Roots.
(TI-1/00), [Report]

Biehl, Ingrid and Buchmann, Johannes and Hamdy, Safuat and Meyer, Andreas (1999):
Cryptographic Protocols Based on Intractability of Extracting Roots and Computing Discrete Logarithms.
(TI-16/99), [Report]

Biehl, Ingrid and Paulus, Sachar and Takagi, Tsuyoshi (1999):
Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic Orders.
(TI-10/99), [Report]

Appel, Helo and Biehl, Ingrid and Fuhrmann, Arnulf and Ruppert, Markus and Takagi, Tsuyoshi and Takura, Akira and Valentin, Christian (1999):
Ein sicherer, robuster Zeitstempeldienst auf der Basis verteilter {RSA}-Signaturen.
(TI-21/99), [Report]

Biehl, Ingrid and Buchmann, Alejandro (1997):
An analysis of the reduction algorithms for binary quadratic forms.
Darmstadt, Techn. Hochschule, FB 20, Inst. für Theoretische Informatik, [Book]

Biehl, Ingrid and Buchmann, Johannes (1997):
An analysis of the reduction algorithms for binary quadratic forms.
(TI-26/97), [Report]

Biehl, Ingrid (1996):
Protocols for collusion-secure asymmetric fingerprinting.
Darmstadt,
Darmstadt, Techn. Hochschule, theoret. Informatik, [Book]

Biehl, Ingrid and Meyer, Bernd (1996):
Protocols for Collusion-Secure Asymmetric Fingerprintig.
(TI-1/96), [Report]

Biehl, Ingrid and Wetzel, (1995):
Traceable visual cryptography.
Darmstadt,
Darmstadt, Techn. Hochschule, Theoretische Informatik, [Book]

Biehl, Ingrid and Buchmann, Johannes and Thiel, Christoph (1994):
Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders.
In: CRYPTO '94 - 14th Annual International Cryptology Conference, Springer, Santa Barbara, California, USA, In: LNCS, ISBN 3-540-58333-5,
[Conference or Workshop Item]

Biehl, Ingrid (1994):
Definition and Existence of Super Complexity Cores.
In: ISAAC '94 - Algorithms and Computation, 5th International Symposium, Springer, Beijing, P. R. China, In: LNCS, ISBN 3-540-58325-4,
[Conference or Workshop Item]

Biehl, Ingrid and Buchmann, Johannes (1994):
Algorithms for quadratic orders.
In: >Mathematics of Computation, [Article]

Biehl, Ingrid (1993):
Eine Grundlegung der Average-Case Komplexitätstheorie.
Universität des Saarlandes, [Ph.D. Thesis]

Biehl, Ingrid and Buchmann, Johannes and Meyer, Bernd and Thiel, Christian and Thiel, Christoph (1992):
Tools for Proving Zero Knowledge.
In: EUROCRYPT '92 - Workshop on the Theory and Application of of Cryptographic Techniques, Springer, Balatonfüred, Hungary, In: LNCS, ISBN 3-540-56413-6,
[Conference or Workshop Item]

This list was generated on Sat Jul 20 00:50:32 2019 CEST.