Advances in Cryptology — CRYPTO ’92: 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16–20, 1992. Proceedings: Lecture Notes in Computer Science, cartea 740
Editat de Ernest F. Brickellen Limba Engleză Paperback – 28 oct 1993
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 405.87 lei
Nou
Puncte Express: 609
Preț estimativ în valută:
77.67€ • 80.60$ • 64.92£
77.67€ • 80.60$ • 64.92£
Carte tipărită la comandă
Livrare economică 15-29 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540573401
ISBN-10: 3540573402
Pagini: 604
Ilustrații: X, 593 p. 75 illus.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.84 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540573402
Pagini: 604
Ilustrații: X, 593 p. 75 illus.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.84 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
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.