Advances in Cryptology - CRYPTO '92
Editat de Ernest F. Brickellen Limba Engleză Paperback – 28 oct 1993
Preț: 337.72 lei
Preț vechi: 422.14 lei
-20%
Puncte Express: 507
Preț estimativ în valută:
59.72€ • 68.48$ • 51.61£
59.72€ • 68.48$ • 51.61£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540573401
ISBN-10: 3540573402
Pagini: 604
Ilustrații: X, 593 p. 75 illus.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.9 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540573402
Pagini: 604
Ilustrații: X, 593 p. 75 illus.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.9 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.