ShopSpell

Public-Key Cryptography -- PKC 2015: 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, Marc [Paperback]

$42.99     $54.99   22% Off      (Free Shipping)
100 available
  • Category: Books (Computers)
  • ISBN-10:  3662464462
  • ISBN-10:  3662464462
  • ISBN-13:  9783662464465
  • ISBN-13:  9783662464465
  • Publisher:  Springer
  • Publisher:  Springer
  • Pages:  810
  • Pages:  810
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Jun-2015
  • Pub Date:  01-Jun-2015
  • SKU:  3662464462-11-SPRI
  • SKU:  3662464462-11-SPRI
  • Item ID: 106432772
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Oct 15 to Oct 17
  • Notes: Brand New Item. Not shipped to AK, HI, APO, FPO, AE.
This book constitutes the refereed proceedings of the 18th International Conference on Practice and Theory in Public-Key Cryptography, PKC 2015, held in Gaithersburg, MD, USA, in March/April 2015.The 36 papers presented in this volume were carefully reviewed and selected from 118 submissions. They are organized in topical sections named: public-key encryption; e-cash; cryptanalysis; digital signatures; password-based authentication; pairint-based cryptography; efficient constructions; cryptography with imperfect keys; interactive proofs; lattice-based cryptography; and identity-based, predicate, and functional encryption.Public-Key Encryption.- Simulation-Based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms.- On the Selective Opening Security of Practical Public-Key Encryption Schemes.- How Secure is Deterministic Encryption?.- E-Cash.- Divisible E-Cash Made Practical.- Anonymous Transferable E-Cash.- Cryptanalysis.- Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem.- A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems.- A Polynomial-Time Attack on the BBCRS Scheme.- Algebraic Cryptanalysis of a Quantum Money Scheme: The Noise-Free Case.- Digital Signatures.- Digital Signatures from Strong RSA without Prime Generation.- Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions.- Tightly-Secure Signatures from Chameleon Hash Functions.- Password-Based Authentication.- Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions.- Adaptive Witness Encryption and Asymmetric Password-Based Cryptography.- Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks.- Pairing-Based Cryptography.- Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds.- A Profitable Sub-prime Loan: Obtaining the Advantages of Composite Order in Prime-Order Bilinear Groups.- Digital Signatures.- Simpler Efficient l£'
Add Review