PKC 2010:

David Pointcheval and Phong Q. Nguyen (Eds.):
Public Key Cryptography - PKC 2010 - PKC 2010,
13th International Conference on Practice and Theory in Public Key Cryptography,
Paris, France,
May 26-28, 2010
Proceedings.

PKC 2010
Paris, France,
May 26-28, 2010

Preface by David Pointcheval and Phong Q. Nguyen (Eds.):

Organizational Committee

Program Chairs :	David Pointcheval and Phong Q. Nguyen
General Chair :	Michel Abdalla and Pierre-Alain Fouque

Program Committee

Alexandra Boldyreva

Xavier Boyen

Dario Catalano

Jung Hee Cheon

Jean-Sébastien Coron

Marc Fischlin

Craig Gentry

Stanislaw Jarecki

Jonathan Katz

Eike Kiltz

Fabien Laguillaumie

Dong Hoon Lee

Reynald Lercier

Benoît Libert

Vadim Lyubashevsky

Mark Manulis

Alfred Menezes

Kenneth G. Paterson

Duong-Hieu Phan

Benny Pinkas

Alon Rosen

Kazue Sako

Hovav Shacham

Martijn Stam

Keisuke Tanaka

Maria Isabel Gonzalez Vasco

Ramarathnam Venkatesan

Damien Vergnaud

Ivan Visconti

Bogdan Warinschi

Brent Waters

Duncan S. Wong

External Referees

Encryption

Protocols I

On the Feasibility of Consistent Computations. , 88-106, Helger Lipmaa , Sven Laur
bib info
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate. , 107-123, Aggelos Kiayias , Jens Groth , Helger Lipmaa
bib info
Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting. , 124-141, Willy Susilo , Yi Mu , Xinyi Huang , Wei Wu , Yang Xiang
bib info

Network Coding

Secure Network Coding over the Integers. , 142-160, Rosario Gennaro , Jonathan Katz , Hugo Krawczyk , Tal Rabin
bib info
Preventing Pollution Attacks in Multi-source Network Coding. , 161-176, Dan Boneh , Xavier Boyen , David Mandell Freeman , Shweta Agrawal
bib info

Tools

Groth-Sahai Proofs Revisited. , 177-192, Nigel P. Smart , Bogdan Warinschi , Essam Ghadafi
bib info
Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments. , 193-208, Ivan Visconti , Zhenfu Cao , Zongyang Zhang
bib info
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions. , 209-223, Michael Scott , Robert Granger
bib info

Elliptic Curves

Faster Pairing Computations on Curves with High-Degree Twists. , 224-242, Tanja Lange , Michael Naehrig , Craig Costello
bib info
Efficient Arithmetic on Hessian Curves. , 243-260, Marc Joye , Reza Rezaeian Farashahi
bib info

Loss Trapdoor Functions

CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model. , 261-278, Keisuke Tanaka , Toshihide Matsuda , Ryo Nishimaki
bib info
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. , 279-295, Eike Kiltz , Oded Goldreich , Alon Rosen , Gil Segev , David Mandell Freeman
bib info
Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions. , 296-311, Scott Yilek , Petros Mol
bib info

Protocols II

Efficient Set Operations in the Presence of Malicious Adversaries. , 312-331, Kobbi Nissim , Carmit Hazay
bib info
Text Search Protocols with Simulation Based Security. , 332-350, Rosario Gennaro , Carmit Hazay , Jeffrey S. Sorensen
bib info

Discrete Logarithms

Solving a 676-Bit Discrete Logarithm Problem in GF(3 ⁶ⁿ ). , 351-367, Tsuyoshi Takagi , Shin'ichiro Matsuo , Masaaki Shirase , Lihua Wang , Takuya Hayashi , Naoyuki Shinohara
bib info
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval. , 368-383, Steven D. Galbraith , Raminder S. Ruprai
bib info

Encryption II

Signatures

Unlinkability of Sanitizable Signatures. , 444-461, Marc Fischlin , Anja Lehmann , Dominique Schröder , Christina Brzuska
bib info
Confidential Signatures and Deterministic Signcryption. , 462-479, Marc Fischlin , Alexander W. Dent , Martijn Stam , Mark Manulis , Dominique Schröder
bib info
Identity-Based Aggregate and Multi-Signature Schemes Based on RSA. , 480-498, Stanislaw Jarecki , Ali Bagherzandi
bib info
Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More. , 499-517, Xavier Boyen
bib info