Publications of pkc 2010

Page	Title
1-18	Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
19-34	Constant Size Ciphertexts in Threshold Attribute-Based Encryption
35-52	Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem
53-69	Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
70-87	Implicit Factoring with Shared Most Significant and Middle Bits
88-106	On the Feasibility of Consistent Computations
107-123	Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
124-141	Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting
142-160	Secure Network Coding over the Integers
161-176	Preventing Pollution Attacks in Multi-source Network Coding
177-192	Groth-Sahai Proofs Revisited
193-208	Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments
209-223	Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
224-242	Faster Pairing Computations on Curves with High-Degree Twists
243-260	Efficient Arithmetic on Hessian Curves
261-278	CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model
279-295	More Constructions of Lossy and Correlation-Secure Trapdoor Functions
296-311	Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
312-331	Efficient Set Operations in the Presence of Malicious Adversaries
332-350	Text Search Protocols with Simulation Based Security
351-367	Solving a 676-Bit Discrete Logarithm Problem in $GF(3^{6n})$
368-383	Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
384-402	Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
403-419	Security of Encryption Schemes in Weakened Random Oracle Models
420-443	Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
444-461	Unlinkability of Sanitizable Signatures
462-479	Confidential Signatures and Deterministic Signcryption
480-498	Identity-Based Aggregate and Multi-Signature Schemes Based on RSA
499-517	Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More