Book Volume 6056 2010

Public Key Cryptography – PKC 2010

13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010. Proceedings


ISBN: 978-3-642-13012-0 (Print) 978-3-642-13013-7 (Online)

Table of contents (29 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Encryption I

    1. Chapter

      Pages 1-18

      Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model

    2. Chapter

      Pages 19-34

      Constant Size Ciphertexts in Threshold Attribute-Based Encryption

  3. Cryptanalysis

    1. Chapter

      Pages 35-52

      Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem

    2. Chapter

      Pages 53-69

      Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA

    3. Chapter

      Pages 70-87

      Implicit Factoring with Shared Most Significant and Middle Bits

  4. Protocols I

    1. Chapter

      Pages 88-106

      On the Feasibility of Consistent Computations

    2. Chapter

      Pages 107-123

      Multi-query Computationally-Private Information Retrieval with Constant Communication Rate

    3. Chapter

      Pages 124-141

      Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting

  5. Network Coding

    1. Chapter

      Pages 142-160

      Secure Network Coding over the Integers

    2. Chapter

      Pages 161-176

      Preventing Pollution Attacks in Multi-source Network Coding

  6. Tools

    1. Chapter

      Pages 177-192

      Groth–Sahai Proofs Revisited

    2. Chapter

      Pages 193-208

      Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments

  7. Elliptic Curves

    1. Chapter

      Pages 209-223

      Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

    2. Chapter

      Pages 224-242

      Faster Pairing Computations on Curves with High-Degree Twists

    3. Chapter

      Pages 243-260

      Efficient Arithmetic on Hessian Curves

  8. Lossy Trapdoor Functions

    1. Chapter

      Pages 261-278

      CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model

    2. Chapter

      Pages 279-295

      More Constructions of Lossy and Correlation-Secure Trapdoor Functions

    3. Chapter

      Pages 296-311

      Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions

  9. Protocols II

    1. Chapter

      Pages 312-331

      Efficient Set Operations in the Presence of Malicious Adversaries

    2. Chapter

      Pages 332-350

      Text Search Protocols with Simulation Based Security

previous Page of 2