The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ingrid Biehl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ingrid Biehl, Tsuyoshi Takagi
    A New Distributed Primality Test for Shared RSA Keys Using Quadratic Fields. [Citation Graph (0, 0)][DBLP]
    ACISP, 2002, pp:1-16 [Conf]
  2. Ingrid Biehl, Jörg Keller
    Effizienzverbesserungen durch schlüssel-optimierte Ver- und Entschlüsselung in Workstations. [Citation Graph (0, 0)][DBLP]
    ARCS, 1999, pp:279-283 [Conf]
  3. Ingrid Biehl, Bernd Meyer, Christoph Thiel
    Cryptographic Protocols Based on Real-Quadratic A-fields. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1996, pp:15-25 [Conf]
  4. Ingrid Biehl, Johannes Buchmann, Christoph Thiel
    Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:56-60 [Conf]
  5. Ingrid Biehl, Bernd Meyer, Volker Müller
    Differential Fault Attacks on Elliptic Curve Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:131-146 [Conf]
  6. Ingrid Biehl, Johannes Buchmann, Bernd Meyer, Christian Thiel, Christoph Thiel
    Tools for Proving Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:356-365 [Conf]
  7. Ingrid Biehl, Bernd Meyer, Susanne Wetzel
    Visual Cryptography - How to Use Images to Share a Secret. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1998, pp:3-12 [Conf]
  8. Ingrid Biehl, Susanne Wetzel
    Traceable visual cryptography. [Citation Graph (0, 0)][DBLP]
    ICICS, 1997, pp:61-71 [Conf]
  9. Ingrid Biehl
    Definition and Existence of Super Complexity Cores. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:600-606 [Conf]
  10. Ingrid Biehl, Bernd Meyer, Susanne Wetzel
    Ensuring the Integrity of Agent-Based Computations by Short Proofs. [Citation Graph (0, 0)][DBLP]
    Mobile Agents, 1998, pp:183-194 [Conf]
  11. Ingrid Biehl, Bernd Meyer
    Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:399-412 [Conf]
  12. Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer
    A Signature Scheme Based on the Intractability of Computing Roots. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:25, n:3, pp:223-236 [Journal]
  13. Ingrid Biehl, Sachar Paulus, Tsuyoshi Takagi
    Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:2, pp:99-123 [Journal]

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002