The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Martín Abadi, Michael Burrows, Butler W. Lampson, Gordon D. Plotkin
    A Calculus for Access Control in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:1-23 [Conf]
  2. Marie-Jeanne Toussaint
    Deriving the Complete Knowledge of Participants in Cryptographic Protocols (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:24-43 [Conf]
  3. Ray Bird, Inder S. Gopal, Amir Herzberg, Philippe A. Janson, Shay Kutten, Refik Molva, Moti Yung
    Systematic Design of Two-Party Authentication Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:44-61 [Conf]
  4. Douglas R. Stinson
    Combinatorial Characterizations of Authentication Codes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:62-73 [Conf]
  5. Douglas R. Stinson
    Universal Hashing and Authentication Codes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:74-85 [Conf]
  6. Paul Camion, Claude Carlet, Pascale Charpin, Nicolas Sendrier
    On Correlation-Immune Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:86-100 [Conf]
  7. Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    On the Size of Shares for Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:101-113 [Conf]
  8. Cynthia Dwork
    On Verification in Secret Sharing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:114-128 [Conf]
  9. Torben P. Pedersen
    Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:129-140 [Conf]
  10. Michael J. Fischer, Rebecca N. Wright
    Multiparty Secret Key Exchange Using a Random Deal of Cards. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:141-155 [Conf]
  11. Eli Biham, Adi Shamir
    Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:156-171 [Conf]
  12. Anne Tardy-Corfdir, Henri Gilbert
    A Known Plaintext Attack of FEAL-4 and FEAL-6. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:172-181 [Conf]
  13. Hikaru Morita, Kazuo Ohta, Shoji Miyaguchi
    A Switching Closure Test to Analyze Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:183-193 [Conf]
  14. Bert den Boer, Antoon Bosselaers
    An Attack on the Last Two Rounds of MD4. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:194-203 [Conf]
  15. Yeow Meng Chee, Antoine Joux, Jacques Stern
    The Cryptoanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:204-212 [Conf]
  16. Dror Lapidot, Adi Shamir
    A One-Round, Two-Prover, Zero-Knowledge Protocol for NP. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:213-224 [Conf]
  17. Joe Kilian, Ronitt Rubinfeld
    Interactive Proofs with Space Bounded Provers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:225-231 [Conf]
  18. Shang-Hua Teng
    Functional Inversion and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:232-241 [Conf]
  19. Steven Rudich
    The Use of Interaction in Public Cryptosystems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:242-251 [Conf]
  20. Kenji Koyama, Ueli M. Maurer, Tatsuaki Okamoto, Scott A. Vanstone
    New Public-Key Schemes Based on Elliptic Curves over the Ring Zn. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:252-266 [Conf]
  21. Tatsuaki Okamoto, Kouichi Sakurai
    Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:267-278 [Conf]
  22. Neal Koblitz
    CM-Curves with Good Cryptographic Properties. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:279-287 [Conf]
  23. Shigeo Tsujii, Jinhui Chao
    A New ID-Based Key Sharing System. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:288-299 [Conf]
  24. Michael Luby
    Pseudo-random Generators from One-way Functions (Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:300- [Conf]
  25. Jacques Patarin
    New Results on Pseudorandom Permutation Generators Based on the DES Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:301-312 [Conf]
  26. Colin D. Walter
    Faster Modular Multiplication by Operand Scaling. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:313-323 [Conf]
  27. Tatsuaki Okamoto, Kazuo Ohta
    Universal Electronic Cash. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:324-337 [Conf]
  28. Birgit Pfitzmann, Michael Waidner
    How To Break and Repair A "Provably Secure" Untraceable Payment System. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:338-350 [Conf]
  29. Charles H. Bennett, Gilles Brassard, Claude Crépeau, Marie-Hélène Skubiszewska
    Practical Quantum Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:351-366 [Conf]
  30. Albert G. Broscius, Jonathan M. Smith
    Exploiting Parallelism in Hardware Implementations of the DES. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:367-376 [Conf]
  31. Donald Beaver
    Foundations of Secure Interactive Computing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:377-391 [Conf]
  32. Silvio Micali, Phillip Rogaway
    Secure Computation (Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:392-404 [Conf]
  33. Kenneth R. Iversen
    A Cryptographic Scheme for Computerized Elections. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:405-419 [Conf]
  34. Donald Beaver
    Efficient Multiparty Protocols Using Circuit Randomization. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:420-432 [Conf]
  35. Charles Rackoff, Daniel R. Simon
    Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:433-444 [Conf]
  36. Ivan Damgård
    Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:445-456 [Conf]
  37. Yvo Desmedt, Yair Frankel
    Shared Generation of Authenticators and Signatures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:457-469 [Conf]
  38. David Chaum, Eugène van Heijst, Birgit Pfitzmann
    Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:470-484 [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