Public Key Cryptography - PKC 2010

Encryption I.- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model.- Constant Size Ciphertexts in Threshold Attribute-Based Encryption.- Cryptanalysis.- Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem.- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA.- Implicit Factoring with Shared Most Significant and Middle Bits.- Protocols I.- On the Feasibility of Consistent Computations.- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate.- Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting.- Network Coding.- Secure Network Coding over the Integers.- Preventing Pollution Attacks in Multi-source Network Coding.- Tools.- Groth-Sahai Proofs Revisited.- Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments.- Elliptic Curves.- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions.- Faster Pairing Computations on Curves with High-Degree Twists.- Efficient Arithmetic on Hessian Curves.- Lossy Trapdoor Functions.- CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model.- More Constructions of Lossy and Correlation-Secure Trapdoor Functions.- Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions.- Protocols II.- Efficient Set Operations in the Presence of Malicious Adversaries.- Text Search Protocols with Simulation Based Security.- Discrete Logarithm.- Solving a 676-Bit Discrete Logarithm Problem in GF(36n ).- Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval.- Encryption II.- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation.- Security of Encryption Schemes in Weakened Random Oracle Models.- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes.- Signatures.- Unlinkability of