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 ; Paulus, Sachar ; Takagi, Tsuyoshi (2004)
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders.
In: >IJDCC: Designs, Codes and Cryptography, 31 (2)
Article

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

Biehl, Ingrid ; Buchmann, Johannes ; Hamdy, Safuat ; Meyer, Andreas (2000)
A Signature Scheme Based on the Intractability of Computing Roots.
Report

Biehl, Ingrid ; Buchmann, Johannes ; Hamdy, Safuat ; Meyer, Andreas (1999)
Cryptographic Protocols Based on Intractability of Extracting Roots and Computing Discrete Logarithms.
Report

Biehl, Ingrid ; Paulus, Sachar ; Takagi, Tsuyoshi (1999)
Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic Orders.
Report

Appel, Helo ; Biehl, Ingrid ; Fuhrmann, Arnulph ; Ruppert, Markus ; Takagi, Tsuyoshi ; Takura, Akira ; Valentin, Christian (1999)
Ein sicherer, robuster Zeitstempeldienst auf der Basis verteilter {RSA}-Signaturen.
Report

Biehl, Ingrid ; Buchmann, Alejandro (1997)
An analysis of the reduction algorithms for binary quadratic forms.
Book

Biehl, Ingrid ; Buchmann, Johannes (1997)
An analysis of the reduction algorithms for binary quadratic forms.
Report

Biehl, Ingrid (1996)
Protocols for collusion-secure asymmetric fingerprinting.
Book

Biehl, Ingrid ; Meyer, Bernd (1996)
Protocols for Collusion-Secure Asymmetric Fingerprintig.
Report

Biehl, Ingrid ; Wetzel, (1995)
Traceable visual cryptography.
Book

Biehl, Ingrid ; Buchmann, Johannes ; Thiel, Christoph (1994)
Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders.
Santa Barbara, California, USA
Conference or Workshop Item

Biehl, Ingrid (1994)
Definition and Existence of Super Complexity Cores.
Beijing, P. R. China
Conference or Workshop Item

Biehl, Ingrid ; 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 ; Buchmann, Johannes ; Meyer, Bernd ; Thiel, Christian ; Thiel, Christoph (1992)
Tools for Proving Zero Knowledge.
Balatonfüred, Hungary
Conference or Workshop Item

This list was generated on Tue Nov 28 01:50:26 2023 CET.