The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Eli Biham, Adi Shamir
    Differential Cryptanalysis of DES-like Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:2-21 [Conf]
  2. Henri Gilbert, Guy Chassé
    A Statistical Attack of the FEAL-8 Cryptosystem. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:22-33 [Conf]
  3. Kencheng Zeng, Chung-Huang Yang, T. R. N. Rao
    An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:34-47 [Conf]
  4. Gilles Brassard, Claude Crépeau
    Quantum Bit Commitment and Coin Tossing Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:49-61 [Conf]
  5. Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway
    Security with Low Communication Overhead. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:62-76 [Conf]
  6. Shafi Goldwasser, Leonid A. Levin
    Fair Computation of General Functions in Presence of Immoral Majority. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:77-93 [Conf]
  7. Gilles Brassard, Moti Yung
    One-Way Group Actions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:94-107 [Conf]
  8. Brian A. LaMacchia, Andrew M. Odlyzko
    Solving Large Sparse Linear Systems over Finite Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:109-133 [Conf]
  9. Johannes Buchmann, Stephan Düllmann
    On the Computation of Discrete Logarithms in Class Groups. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:134-139 [Conf]
  10. Chih-Chwen Chuang, James George Dunham
    Matrix Extensions of the RSA Algorithm. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:140-155 [Conf]
  11. Neal Koblitz
    Constructing Elliptic Curve Cryptosystems in Characteristic 2. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:156-167 [Conf]
  12. Thomas Beth, Yvo Desmedt
    Identification Tokens - or: Solving the Chess Grandmaster Problem. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:169-177 [Conf]
  13. Yvo Desmedt, Moti Yung
    Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:177-188 [Conf]
  14. Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen
    Convertible Undeniable Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:189-205 [Conf]
  15. David Chaum, Sandra Roijakkers
    Unconditionally Secure Digital Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:206-214 [Conf]
  16. Gustavus J. Simmons
    Geometric Shared Secret and/or Shared Control Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:216-241 [Conf]
  17. Ernest F. Brickell, Douglas R. Stinson
    Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:242-252 [Conf]
  18. Silvio Micali, Tal Rabin
    Collective Coin Tossing Without Assumptions nor Broadcasting. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:253-266 [Conf]
  19. Yacov Yacobi
    A Key Distribution "Paradox". [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:268-273 [Conf]
  20. Walter Fumy, Michael Munzert
    A Modular Approach to Key Distribution. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:274-283 [Conf]
  21. Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
    Structural Properties of One-way Hash Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:285-302 [Conf]
  22. Ronald L. Rivest
    The MD4 Message Digest Algorithm. [Citation Graph (1, 0)][DBLP]
    CRYPTO, 1990, pp:303-311 [Conf]
  23. Joe Kilian
    Achieving Zero-Knowledge Robustly. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:313-325 [Conf]
  24. Donald Beaver, Joan Feigenbaum, Victor Shoup
    Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:326-338 [Conf]
  25. Kaoru Kurosawa, Shigeo Tsujii
    Multi-Language Zero Knowledge Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:339-352 [Conf]
  26. Dror Lapidot, Adi Shamir
    Publicly Verifiable Non-Interactive Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:353-365 [Conf]
  27. Alfredo De Santis, Moti Yung
    Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:366-377 [Conf]
  28. Joe Kilian
    Interactive Proofs with Provable Security Against Honest Verifiers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:378-392 [Conf]
  29. A. W. Schrift
    Adi Shamir: On the Universality of the Next Bit Test. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:394-408 [Conf]
  30. Ueli M. Maurer
    A Universal Statistical Test for Random Bit Generators. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:409-420 [Conf]
  31. James L. McInnes, Benny Pinkas
    On the Impossibility of Private Key Cryptography with Weakly Random Keys. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:421-435 [Conf]
  32. Stuart Haber, W. Scott Stornetta
    How to Time-Stamp a Digital Document. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:437-455 [Conf]
  33. Tatsuaki Okamoto, Kazuo Ohta
    How to Utilize the Randomness of Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:456-475 [Conf]
  34. Ralph C. Merkle
    Fast Software Encryption Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:476-501 [Conf]
  35. Dominique de Waleffe, Jean-Jacques Quisquater
    CORSAIR: A SMART Card for Public Key Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:502-513 [Conf]
  36. Kireeti Kompella, Leonard M. Adleman
    Fast Checkers for Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:515-529 [Conf]
  37. Richard Cleve
    Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:530-544 [Conf]
  38. Thomas W. Cusick, Michael C. Wood
    The REDOC II Cryptosystem. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:545-563 [Conf]
  39. Kwangjo Kim, Tsutomu Matsumoto, Hideki Imai
    A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:564-574 [Conf]
  40. Paul C. van Oorschot
    A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:576-581 [Conf]
  41. Kenji Koyama, Routo Terada
    Nonlinear Parity Circuits and their Cryptographic Applications. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:582-600 [Conf]
  42. Othmar Staffelbach, Willi Meier
    Cryptographic Significance of the Carry for Ciphers Based on Integer Addition. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:601-614 [Conf]
  43. Brian A. LaMacchia, Andrew M. Odlyzko
    Computation of Discrete Logarithms in Prime Fields (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:616-618 [Conf]
  44. Shimon Even
    Systolic Modular Multiplication. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:619-624 [Conf]
  45. Ronald L. Rivest
    Finding Four Million Large Random Primes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:625-626 [Conf]
  46. Shoji Miyaguchi
    The FEAL Cipher Family. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:627-638 [Conf]
  47. Yacov Yacobi
    Discrete-Log With Compressible Exponents. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:639-643 [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