Advances in cryptology - CRYPTO 86 : proceedings
This book is the proceedings of CRYPTO 86, one in a series of annual conferences devoted to cryptologic research. They have all been held at the University of California at Santa Barbara. The first conference in this series, CRYPTO 81, organized by A. Gersho, did not have a formal proceedings. The p...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
2003.
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
263 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
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 '86, proceedings, A.M. Odlyzko (ed.), Berlin, Springer, 1987, 1 vol. (XI-487 p.), Lecture notes in computer science, 3-540-18047-8 • Advances in Cryptology - CRYPTO '86, Texte imprimé, 9783540800194 |
Indholdsfortegnelse:
- Data Encryption Standard
- Structure in the S-Boxes of the DES (extended abstract)
- Cycle Structure of the DES with Weak and Semi-Weak Keys
- Public-Key Cryptography
- Private-Key Algebraic-Coded Cryptosystems
- Some Variations on RSA Signatures & their Security
- Breaking the Cade Cipher
- A Modification of a Broken Public-Key Cipher
- A Pseudo-Random Bit Generator Based on Elliptic Logarithms
- Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme
- Public-key Systems Based on the Difficulty of Tampering (Is there a difference between DES and RSA?)
- A Secure and Privacy-Protecting Protocol for Transmitting Personal Information Between Organizations
- Cryptographic Protocols And Zero-Knowledge Proofs
- How to Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design (Extended Abstract)
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How
- Demonstrating Possession of a Discrete Logarithm Without Revealing it
- Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols
- Zero-Knowledge Simulation of Boolean Circuits
- All-or-Nothing Disclosure of Secrets
- A zero-knowledge Poker protocol that achieves confidentiality of the players strategy or How to achieve an electronic Poker face
- Secret-Sharing Methods
- Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)
- How to Share a Secret with Cheaters
- Smallest Possible Message Expansion in Threshold Schemes
- Hardware Systems
- VLSI implementation of public-key encryption algorithms
- Architectures for exponentiation in GF(2n)
- Implementing the Rivest Shamir and Adleman Public KeyEncryption Algorithm on a Standard Digital Signal Processor
- Software Systems
- A High Speed Manipulation Detection Code
- Electronic Funds Transfer Point of Sale in Australia
- Software Protection, Probabilistic Methods, and Other Topics
- The Notion of Security for Probabilistic Cryptosystems (Extended Abstract)
- Large-Scale Randomization Techniques
- On the Linear Span of Binary Sequences Obtained from Finite Geometries
- Some Constructions and Bounds for Authentication Codes
- Towards a Theory of Software Protection (Extended Abstract)
- Informal Contributions
- Two Observations on Probabilistic Primality Testing
- Public Key Registration
- Is there an ultimate use of cryptography? (Extended Abstract)
- Smart Card a Highly Reliable and Portable Security Device
- Thomas A Complete Single Chip RSA Device.