Public Key Cryptography - PKC 2010: 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010, Proceedings (Lecture Notes in Computer Science, nr. 6056)

Editat de Phong Q. Nguyen, David Pointcheval
Notă GoodReads:
en Limba Engleză Paperback – 20 May 2010

Din seria Lecture Notes in Computer Science

Preț: 58407 lei

Preț vechi: 73010 lei

Puncte Express: 876

Preț estimativ în valută:
11310 11740$ 9770£

Carte disponibilă

Livrare economică 22 decembrie 22 - 05 ianuarie 23
Livrare express 14-22 decembrie pentru 6510 lei

Preluare comenzi: 021 569.72.76


ISBN-13: 9783642130120
ISBN-10: 3642130127
Pagini: 532
Ilustrații: XIII, 519 p. 34 illus.
Greutate: 0.8 kg
Ediția: 2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science , Security and Cryptology

Locul publicării: Berlin, Heidelberg, Germany

Public țintă



Encryption I.- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model.- Constant Size Ciphertexts in Threshold Attribute-Based Encryption.- Cryptanalysis.- Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem.- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA.- Implicit Factoring with Shared Most Significant and Middle Bits.- Protocols I.- On the Feasibility of Consistent Computations.- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate.- Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting.- Network Coding.- Secure Network Coding over the Integers.- Preventing Pollution Attacks in Multi-source Network Coding.- Tools.- Groth–Sahai Proofs Revisited.- Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments.- Elliptic Curves.- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions.- Faster Pairing Computations on Curves with High-Degree Twists.- Efficient Arithmetic on Hessian Curves.- Lossy Trapdoor Functions.- CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model.- More Constructions of Lossy and Correlation-Secure Trapdoor Functions.- Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions.- Protocols II.- Efficient Set Operations in the Presence of Malicious Adversaries.- Text Search Protocols with Simulation Based Security.- Discrete Logarithm.- Solving a 676-Bit Discrete Logarithm Problem in GF(36n ).- Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval.- Encryption II.- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation.- Security of Encryption Schemes in Weakened Random Oracle Models.- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes.- Signatures.- Unlinkability of Sanitizable Signatures.- Confidential Signatures and Deterministic Signcryption.- Identity-Based Aggregate and Multi-Signature Schemes Based on RSA.- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More.