Advances in cryptology - CRYPTO 92 : 12th annual international cryptology conference, Santa Barbara, California, USA, August 16-20, 1992 : proceedings
Crypto'92 took place on August 16-20, 1992. It was the twelfth in the series of annual cryptology conferences held on the beautiful campus of the University of California, Santa Barbara. Once again, it was sponsored by the International Association for Cryptologic Research, in cooperation with...
Enregistré dans:
| 企業作者: | |
|---|---|
| 其他作者: | |
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| 叢編: | Lecture notes in computer science
740 |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Advances in cryptology--CRYPTO '92, 12th annual international cryptology conference, Santa Barbara, California, USA, August 16-20, 1992, proceedings, Ernest F. Brickell (ed.), 1993, Berlin, Springer, 1 vol. (X-593 p.), Lecture notes in computer science, 0-387-57340-2 • Advances in Cryptology CRYPTO 92, Texte imprimé, 9783662215333 |
書本目錄:
- Digital Signatures and Identification I
- Provably Unforgeable Signatures
- New Constructions of Fail-Stop Signatures and Lower Bounds
- Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
- An Efficient Digital Signature Scheme Based on an Elliptic Curve over the Ring Z n
- The Digital Signature Standard
- Designing and Detecting Trapdoors for Discrete Log Cryptosystems
- Response to Comments on the NIST Proposed Digital Signature Standard
- Applications and New Problems
- Wallet Databases with Observers
- Making Electronic Refunds Safer
- Fair Public-Key Cryptosystems
- Pricing via Processing or Combatting Junk Mail
- Secret Sharing I
- On the Information Rate of Secret Sharing Schemes
- New General Lower Bounds on the Information Rate of Secret Sharing Schemes
- Universally Ideal Secret Sharing Schemes
- Theory I
- Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions
- Low communication 2-prover zero-knowledge proofs for NP
- Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent
- On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols
- Cryptographic Functions
- On the Design of SP Networks from an Information Theoretic Point of View
- Partially-bent functions
- Digital Signatures and Identifcation II
- Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks
- On the Security of the Permuted Kernel Identification Scheme
- Computational Number Theory
- Massively Parallel Computation of Discrete Logarithms
- A Quadratic Sieve on the n-Dimensional Cube
- Efficient Multiplication on Certain Nonsupersingular Elliptic Curves
- Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
- On Generation of Probable Primes by Incremental Search
- Cryptography Education
- Kid Krypto
- Theory II
- On Defining Proofs of Knowledge
- Public Randomness in Cryptography
- Necessary and Sufficient Conditions for Collision-Free Hashing
- Certifying Cryptographic Tools: The Case of Trapdoor Permutations
- Key Distribution
- Protocols for Secret Key Agreement by Public Discussion Based on Common Information
- Perfectly-Secure Key Distribution for Dynamic Conferences
- DES
- Differential Cryptanalysis of the Full 16-round DES
- Iterative Characteristics of DES and s2-DES
- DES is not a Group
- A High-speed DES Implementation for Network Applications
- Secret Sharing II
- Threshold Schemes with Disenrollment
- Non-existence of homomorphic general sharing schemes for some key spaces
- An l-Span Generalized Secret Sharing Scheme
- Rump Session
- Provable Security Against Differential Cryptanalysis
- Content-Addressable Search Engines and DES-like Systems
- FFT-Hash-II is not yet Collision-free.