Advances in Cryptology -- CRYPTO' 92 : 12th Annual International Cryptology Conference Santa Barbara, California, USA August 16-20, 1992 Proceedings / edited by Ernest F. Brickell.

By: Brickell, Ernest F
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 740.Publisher: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 1993Description: 1 online resource : v.: digitalContent type: text Media type: computer Carrier type: online resourceISBN: 9783540480716; 3540480714Subject(s): Computer science | Operating systems (Computers) | Data encryption (Computer science) | Coding theory | Database management | Combinatorial analysis | Sécurité informatique -- Congrès | Cryptographie -- Congrès | Coding theory | Combinatorial analysis | Computer science | Data encryption (Computer science) | Database management | Operating systems (Computers)Genre/Form: Electronic books. Additional physical formats: Printed edition:: No titleDDC classification: 005.82 LOC classification: QA76.9.A25Other classification: 54.62 Online 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.
Summary: This volume constitutes the proceedings of CRYPTO `92, held in Santa Barbara, California, August 16-20, 1992; this event was the 12th in the series of annual CRYPTO conferences organized by the International Association for Croptologic Research (IACR). Besides 2 invited papers byMiles Smid and Mike Fellows and 3 papers presented at the rump session, thisproceedings contains revised versions of the 38 contributed papers selected by the international program committee from a total of 135 submissions. Most theoretical and practical aspects of cryptology are represented: the volume is organized in chapters on digital signatures and identification, the digital signature standard, applications and new problems, secret sharing, theory, cryptographic functions, computationalnumber theory, cryptography education, key distribution, and data encryptionstandards (DES).
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

This volume constitutes the proceedings of CRYPTO `92, held in Santa Barbara, California, August 16-20, 1992; this event was the 12th in the series of annual CRYPTO conferences organized by the International Association for Croptologic Research (IACR). Besides 2 invited papers byMiles Smid and Mike Fellows and 3 papers presented at the rump session, thisproceedings contains revised versions of the 38 contributed papers selected by the international program committee from a total of 135 submissions. Most theoretical and practical aspects of cryptology are represented: the volume is organized in chapters on digital signatures and identification, the digital signature standard, applications and new problems, secret sharing, theory, cryptographic functions, computationalnumber theory, cryptography education, key distribution, and data encryptionstandards (DES).

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.

There are no comments for this item.

to post a comment.

Powered by Koha