Skip to main content
SpringerLink
Log in

Public Key Cryptography - PKC 2010

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

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Phong Q. Nguyen

    1. Département d’Informatique, École Normale Supérieure, Paris Cedex 05, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. David Pointcheval

    1. Département d’Informatique, École Normale Supérieure, Paris Cedex 05, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6056)

Part of the book sub series: Security and Cryptology (LNSC)

Included in the following conference series:

Conference proceedings info: PKC 2010.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Front Matter

    Download chapter PDF

  2. Encryption I

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

      • Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup
      Pages 1-18

    2. Constant Size Ciphertexts in Threshold Attribute-Based Encryption

      • Javier Herranz, Fabien Laguillaumie, Carla Ràfols
      Pages 19-34

  3. Cryptanalysis

    1. Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem

      • Jean-Charles Faugère, Pierre-Jean Spaenlehauer
      Pages 35-52

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

      • Mathias Herrmann, Alexander May
      Pages 53-69

    3. Implicit Factoring with Shared Most Significant and Middle Bits

      • Jean-Charles Faugère, Raphaël Marinier, Guénaël Renault
      Pages 70-87

  4. Protocols I

    1. On the Feasibility of Consistent Computations

      • Sven Laur, Helger Lipmaa
      Pages 88-106

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

      • Jens Groth, Aggelos Kiayias, Helger Lipmaa
      Pages 107-123

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

      • Xinyi Huang, Yi Mu, Willy Susilo, Wei Wu, Yang Xiang
      Pages 124-141

  5. Network Coding

    1. Secure Network Coding over the Integers

      • Rosario Gennaro, Jonathan Katz, Hugo Krawczyk, Tal Rabin
      Pages 142-160

    2. Preventing Pollution Attacks in Multi-source Network Coding

      • Shweta Agrawal, Dan Boneh, Xavier Boyen, David Mandell Freeman
      Pages 161-176

  6. Tools

    1. Groth–Sahai Proofs Revisited

      • Essam Ghadafi, Nigel. P. Smart, Bogdan Warinschi
      Pages 177-192

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

      • Zhenfu Cao, Ivan Visconti, Zongyang Zhang
      Pages 193-208

  7. Elliptic Curves

    1. Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

      • Robert Granger, Michael Scott
      Pages 209-223

    2. Faster Pairing Computations on Curves with High-Degree Twists

      • Craig Costello, Tanja Lange, Michael Naehrig
      Pages 224-242

    3. Efficient Arithmetic on Hessian Curves

      • Reza R. Farashahi, Marc Joye
      Pages 243-260

  8. Lossy Trapdoor Functions

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

      • Toshihide Matsuda, Ryo Nishimaki, Keisuke Tanaka
      Pages 261-278

    2. More Constructions of Lossy and Correlation-Secure Trapdoor Functions

      • David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev
      Pages 279-295

    3. Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions

      • Petros Mol, Scott Yilek
      Pages 296-311

  9. Protocols II

    1. Efficient Set Operations in the Presence of Malicious Adversaries

      • Carmit Hazay, Kobbi Nissim
      Pages 312-331
Back to top

Other volumes

  1. Public Key Cryptography – PKC 2010

Keywords

Editors and Affiliations

  • Département d’Informatique, École Normale Supérieure, Paris Cedex 05, France

    Phong Q. Nguyen, David Pointcheval

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation