The SCEAS System
Navigation Menu

Conferences in DBLP

International Crytology Conference (CRYPTO) (crypto)
1992 (conf/crypto/1992)

  1. Jurjen N. Bos, David Chaum
    Provably Unforgeable Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:1-14 [Conf]
  2. Eugène van Heijst, Torben P. Pedersen, Birgit Pfitzmann
    New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:15-30 [Conf]
  3. Tatsuaki Okamoto
    Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:31-53 [Conf]
  4. Tatsuaki Okamoto, Atsushi Fujioka, Eiichiro Fujisaki
    An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Zn. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:54-65 [Conf]
  5. Daniel M. Gordon
    Designing and Detecting Trapdoors for Discrete Log Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:66-75 [Conf]
  6. Miles E. Smid, Dennis K. Branstad
    Response to Comments of the NIST Proposed Digital Signature Standard. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:76-88 [Conf]
  7. David Chaum, Torben P. Pedersen
    Wallet Databases with Observers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:89-105 [Conf]
  8. Rafael Hirschfeld
    Making Electronic Refunds Safer. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:106-112 [Conf]
  9. Silvio Micali
    Fair Public-Key Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:113-138 [Conf]
  10. Cynthia Dwork, Moni Naor
    Pricing via Processing or Combatting Junk Mail. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:139-147 [Conf]
  11. Carlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    On the Information Rate of Secret Sharing Schemes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:148-167 [Conf]
  12. Douglas R. Stinson
    New General Lower Bounds on the Information Rate of Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:168-182 [Conf]
  13. Amos Beimel, Benny Chor
    Universally Ideal Secret Sharing Schemes (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:183-195 [Conf]
  14. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
    Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:196-214 [Conf]
  15. Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra
    Low Communication 2-Prover Zero-Knowledge Proofs for NP. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:215-227 [Conf]
  16. Shafi Goldwasser, Rafail Ostrovsky
    Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:228-245 [Conf]
  17. Kouichi Sakurai, Toshiya Itoh
    On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:246-259 [Conf]
  18. M. Sivabalan, Stafford E. Tavares, Lloyd E. Peppard
    On the Design of SP Networks From an Information Theoretic Point of View. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:260-279 [Conf]
  19. Claude Carlet
    Partially-Bent Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:280-291 [Conf]
  20. Yuliang Zheng, Jennifer Seberry
    Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:292-304 [Conf]
  21. Thierry Baritaud, Mireille Campana, Pascal Chauvaud, Henri Gilbert
    On the Security of the Permuted Kernel Identification Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:305-311 [Conf]
  22. Daniel M. Gordon, Kevin S. McCurley
    Massively Parallel Computation of Discrete Logarithms. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:312-323 [Conf]
  23. René Peralta
    A Quadratic Sieve on the n-Dimensional Cube. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:324-332 [Conf]
  24. Willi Meier, Othmar Staffelbach
    Efficient Multiplication on Certain Nonsupersingular Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:333-344 [Conf]
  25. Kenji Koyama, Yukio Tsuruoka
    Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:345-357 [Conf]
  26. Jørgen Brandt, Ivan Damgård
    On Generation of Probable Primes By Incremental Search. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:358-370 [Conf]
  27. Michael R. Fellows, Neal Koblitz
    Kid Krypto. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:371-389 [Conf]
  28. Mihir Bellare, Oded Goldreich
    On Defining Proofs of Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:390-420 [Conf]
  29. Amir Herzberg, Michael Luby
    Pubic Randomness in Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:421-432 [Conf]
  30. Alexander Russell
    Necessary and Sufficient Conditions For Collision-Free Hashing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:433-441 [Conf]
  31. Mihir Bellare, Moti Yung
    Certifying Cryptographic Tools: The Case of Trapdoor Permutations. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:442-460 [Conf]
  32. Ueli M. Maurer
    Protocols for Secret Key Agreement by Public Discussion Based on Common Information. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:461-470 [Conf]
  33. Carlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten, Ugo Vaccaro, Moti Yung
    Perfectly-Secure Key Distribution for Dynamic Conferences. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:471-486 [Conf]
  34. Eli Biham, Adi Shamir
    Differential Cryptanalysis of the Full 16-Round DES. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:487-496 [Conf]
  35. Lars R. Knudsen
    Iterative Characteristics of DES and s²-DES. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:497-511 [Conf]
  36. Keith W. Campbell, Michael J. Wiener
    DES is not a Group. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:512-520 [Conf]
  37. Hans Eberle
    A High-Speed DES Implementation for Network Applications. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:521-539 [Conf]
  38. Bob Blakley, G. R. Blakley, Agnes Hui Chan, James L. Massey
    Threshold Schemes with Disenrollment. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:540-548 [Conf]
  39. Yair Frankel, Yvo Desmedt, Mike Burmester
    Non-Existence of Homomorphic General Sharing Schemes for Some Key Spaces (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:549-557 [Conf]
  40. Lein Harn, Hung-Yu Lin
    An l-Span Generalized Secret Sharing Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:558-565 [Conf]
  41. Kaisa Nyberg, Lars R. Knudsen
    Provable Security Against Differential Cryptanalysis. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:566-574 [Conf]
  42. Peter C. Wayner
    Content-Addressable Search Engines and DES-like Systems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:575-586 [Conf]
  43. Serge Vaudenay
    FFT-Hash-II is not yet Collision-free. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:587-593 [Conf]
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