Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th CRYPTO 1990: Santa Barbara, California, USA
- Alfred Menezes, Scott A. Vanstone:
Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings. Lecture Notes in Computer Science 537, Springer 1991, ISBN 3-540-54508-5
Cryptanalysis
- Eli Biham, Adi Shamir:
Differential Cryptanalysis of DES-like Cryptosystems. 2-21 - Henri Gilbert, Guy Chassé:
A Statistical Attack of the FEAL-8 Cryptosystem. 22-33 - Kencheng Zeng, Chung-Huang Yang, T. R. N. Rao:
An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications. 34-47
Protocols
- Gilles Brassard, Claude Crépeau:
Quantum Bit Commitment and Coin Tossing Protocols. 49-61 - Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway:
Security with Low Communication Overhead. 62-76 - Shafi Goldwasser, Leonid A. Levin:
Fair Computation of General Functions in Presence of Immoral Majority. 77-93 - Gilles Brassard, Moti Yung:
One-Way Group Actions. 94-107
Algebra and Number Theory
- Brian A. LaMacchia, Andrew M. Odlyzko:
Solving Large Sparse Linear Systems over Finite Fields. 109-133 - Johannes A. Buchmann, Stephan Düllmann:
On the Computation of Discrete Logarithms in Class Groups. 134-139 - Chih-Chwen Chuang, James George Dunham:
Matrix Extensions of the RSA Algorithm. 140-155 - Neal Koblitz:
Constructing Elliptic Curve Cryptosystems in Characteristic 2. 156-167
Signatures and Authentication
- Thomas Beth, Yvo Desmedt:
Identification Tokens - or: Solving the Chess Grandmaster Problem. 169-177 - Yvo Desmedt, Moti Yung:
Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract). 177-188 - Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen:
Convertible Undeniable Signatures. 189-205 - David Chaum, Sandra Roijakkers:
Unconditionally Secure Digital Signatures. 206-214
Secret Sharing
- Gustavus J. Simmons:
Geometric Shared Secret and/or Shared Control Schemes. 216-241 - Ernest F. Brickell, Douglas R. Stinson:
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. 242-252 - Silvio Micali, Tal Rabin:
Collective Coin Tossing Without Assumptions nor Broadcasting. 253-266
Key Distribution
- Yacov Yacobi:
A Key Distribution "Paradox". 268-273 - Walter Fumy, Michael Munzert:
A Modular Approach to Key Distribution. 274-283
Hash Functions
- Yuliang Zheng
, Tsutomu Matsumoto, Hideki Imai:
Structural Properties of One-way Hash Functions. 285-302 - Ronald L. Rivest:
The MD4 Message Digest Algorithm. 303-311
Zero-Knowledge
- Joe Kilian:
Achieving Zero-Knowledge Robustly. 313-325 - Donald Beaver, Joan Feigenbaum, Victor Shoup:
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract). 326-338 - Kaoru Kurosawa, Shigeo Tsujii:
Multi-Language Zero Knowledge Interactive Proof Systems. 339-352 - Dror Lapidot, Adi Shamir:
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs. 353-365 - Alfredo De Santis, Moti Yung:
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems. 366-377 - Joe Kilian:
Interactive Proofs with Provable Security Against Honest Verifiers. 378-392
Randomness
- A. W. Schrift, Adi Shamir:
On the Universality of the Next Bit Test. 394-408 - Ueli M. Maurer:
A Universal Statistical Test for Random Bit Generators. 409-420 - James L. McInnes, Benny Pinkas:
On the Impossibility of Private Key Cryptography with Weakly Random Keys. 421-435
Applications
- Stuart Haber, W. Scott Stornetta:
How to Time-Stamp a Digital Document. 437-455 - Tatsuaki Okamoto, Kazuo Ohta:
How to Utilize the Randomness of Zero-Knowledge Proofs. 456-475 - Ralph C. Merkle:
Fast Software Encryption Functions. 476-501 - Dominique de Waleffe, Jean-Jacques Quisquater:
CORSAIR: A SMART Card for Public Key Cryptosystems. 502-513
Design and Analysis I
- Kireeti Kompella, Leonard M. Adleman:
Fast Checkers for Cryptography. 515-529 - Richard Cleve:
Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. 530-544 - Thomas W. Cusick, Michael C. Wood:
The REDOC II Cryptosystem. 545-563 - Kwangjo Kim, Tsutomu Matsumoto, Hideki Imai:
A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion. 564-574
Design and Analysis II
- Paul C. van Oorschot:
A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms. 576-581 - Kenji Koyama, Routo Terada:
Nonlinear Parity Circuits and their Cryptographic Applications. 582-600 - Othmar Staffelbach, Willi Meier:
Cryptographic Significance of the Carry for Ciphers Based on Integer Addition. 601-614
Impromptu Talks
- Brian A. LaMacchia, Andrew M. Odlyzko:
Computation of Discrete Logarithms in Prime Fields (Extended Abstract). 616-618 - Shimon Even:
Systolic Modular Multiplication. 619-624 - Ronald L. Rivest:
Finding Four Million Large Random Primes. 625-626 - Shoji Miyaguchi:
The FEAL Cipher Family. 627-638 - Yacov Yacobi:
Discrete-Log With Compressible Exponents. 639-643
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
