Advances in Cryptology — CRYPTO’ 92 [electronic resource] : 12th Annual International Cryptology Conference Santa Barbara, California, USA August 16–20, 1992 Proceedings / edited by Ernest F. Brickell.

By: Brickell, Ernest F [editor.]Contributor(s): SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 740Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1993Description: X, 593 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540480716Subject(s): Computer science | Operating systems (Computers) | Data encryption (Computer science) | Coding theory | Database management | Combinatorics | Computer Science | Data Encryption | Coding and Information Theory | Database Management | Combinatorics | Operating SystemsAdditional physical formats: Printed edition:: No titleDDC classification: 005.82 LOC classification: QA76.9.A25Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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 the IEEE Computer Society Technical Committee on Security and Privacy. The conference ran smoothly, due to the diligent efforts of the g- eral chair, Spyros Magliveras of the University of Nebraska. One of the measures of the success of this series of conferences is represented by the ever increasing number of papers submitted. This year, there were 135 submissions to the c- ference, which represents a new record. Following the practice of recent program comm- tees, the papers received anonymous review. The program committee accepted 38 papers for presentation. In addition, there were two invited presentations, one by Miles Smid on the Digital Signature Standard, and one by Mike Fellows on presenting the concepts of cryptology to elementary-age students. These proceedings contains these 40 papers plus 3 papers that were presented at the Rump Session. I would like to thank all of the authors of the submitted papers and all of the speakers who presented papers. I would like to express my sincere appreciation to the work of the program committee: Ivan Damgard (Aarhus University, Denmark), Odd Goldreich (Technion, Israel), Burt Kaliski (RSA Data Security, USA), Joe Kilian (NEC, USA).
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

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 the IEEE Computer Society Technical Committee on Security and Privacy. The conference ran smoothly, due to the diligent efforts of the g- eral chair, Spyros Magliveras of the University of Nebraska. One of the measures of the success of this series of conferences is represented by the ever increasing number of papers submitted. This year, there were 135 submissions to the c- ference, which represents a new record. Following the practice of recent program comm- tees, the papers received anonymous review. The program committee accepted 38 papers for presentation. In addition, there were two invited presentations, one by Miles Smid on the Digital Signature Standard, and one by Mike Fellows on presenting the concepts of cryptology to elementary-age students. These proceedings contains these 40 papers plus 3 papers that were presented at the Rump Session. I would like to thank all of the authors of the submitted papers and all of the speakers who presented papers. I would like to express my sincere appreciation to the work of the program committee: Ivan Damgard (Aarhus University, Denmark), Odd Goldreich (Technion, Israel), Burt Kaliski (RSA Data Security, USA), Joe Kilian (NEC, USA).

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha