Public Key Cryptography - PKC 2007: 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16-20, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4450
Editat de Tatsuaki Okamoto, Xiaoyun Wangen Limba Engleză Paperback – 30 mar 2007
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 341.95 lei
- 20% Preț: 369.12 lei
- 20% Preț: 645.28 lei
- 20% Preț: 591.51 lei
- 15% Preț: 580.46 lei
- Preț: 410.88 lei
- 20% Preț: 504.57 lei
- Preț: 381.21 lei
- 20% Preț: 340.32 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 538.29 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 238.01 lei
- 17% Preț: 360.19 lei
- 20% Preț: 438.69 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 596.46 lei
- 15% Preț: 438.59 lei
- 20% Preț: 655.02 lei
- 20% Preț: 649.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 310.26 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ț: 326.98 lei
- 20% Preț: 825.93 lei
- 17% Preț: 427.22 lei
- 20% Preț: 763.23 lei
- 20% Preț: 350.21 lei
- 20% Preț: 307.71 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 20% Preț: 343.62 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 353.50 lei
- 20% Preț: 607.39 lei
Preț: 400.47 lei
Nou
Puncte Express: 601
Preț estimativ în valută:
76.65€ • 79.72$ • 64.23£
76.65€ • 79.72$ • 64.23£
Carte tipărită la comandă
Livrare economică 14-28 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540716761
ISBN-10: 3540716769
Pagini: 512
Ilustrații: XIV, 498 p.
Dimensiuni: 155 x 235 x 40 mm
Greutate: 0.71 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540716769
Pagini: 512
Ilustrații: XIV, 498 p.
Dimensiuni: 155 x 235 x 40 mm
Greutate: 0.71 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Signatures I.- Full-Domain Subgroup Hiding and Constant-Size Group Signatures.- A Direct Anonymous Attestation Scheme for Embedded Devices.- Anonymous Signatures Made Easy.- On the Generic and Efficient Constructions of Secure Designated Confirmer Signatures.- Invited Talk I.- Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions.- Cryptanalysis.- Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol.- New Chosen-Ciphertext Attacks on NTRU.- Cryptanalysis of the Paeng-Jung-Ha Cryptosystem from PKC 2003.- Protocols I.- Optimistic Fair Exchange in a Multi-user Setting.- Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures.- Knowledge-Binding Commitments with Applications in Time-Stamping.- Signatures II.- Efficient Ring Signatures Without Random Oracles.- Traceable Ring Signature.- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles.- Improved On-Line/Off-Line Threshold Signatures.- Multivariate Cryptosystems.- High Order Linearization Equation (HOLE) Attack on Multivariate Public Key Cryptosystems.- Cryptanalysis of HFE with Internal Perturbation.- ?-Invertible Cycles for ultivariate uadratic ( ) Public Key Cryptography.- Encryption.- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman.- Parallel Key-Insulated Public Key Encryption Without Random Oracles.- Multi-bit Cryptosystems Based on Lattice Problems.- Protocols II.- Practical and Secure Solutions for Integer Comparison.- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol.- Identity-Based Traitor Tracing.- Verifiable Shuffle of Large Size Ciphertexts.- Invited Talk II.- A Survey of Single-DatabasePrivate Information Retrieval: Techniques and Applications.- Number Theoretic Techniques.- Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA.- Efficient Pseudorandom Generators Based on the DDH Assumption.- Fast Batch Verification of Multiple Signatures.- Public-Key Infrastructure.- A Closer Look at PKI: Security and Efficiency.- Self-Generated-Certificate Public Key Encryption Without Pairing.