Publications of pkc 2011

Page	Title
1	Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
17	Homomorphic Network Coding Signatures in the Standard Model
35	Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model
53	Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
71	Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption
90	Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
109	Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three
128	On the correct use of the negation map in the Pollard rho method
147	Cryptanalysis of the RSA Subgroup from TCC 2005
156	(If) Size Matters: Size-Hiding Private Set Intersection
174	Sub-Linear, Secure Comparison With Two Non-Colluding Parties
192	Oblivious Transfer with Hidden Access Control Lists
210	Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited
228	Chameleon All-But-One TDFs and Their Application to Chosen-Ciphertext Security
246	Parallel Decryption Queries in Bounded Chosen Ciphertext Attacks
265	Secure Blind Decryption
283	New Developments in Leakage-Resilient Cryptography
284	On the Security of a Bidirectional Proxy Re-Encryption Scheme from PKC 2010
296	Fully Secure Accountable-Authority Identity-Based Encryption
317	One-Pass HMQV and Asymmetric Key-Wrapping
335	Linear Recurring Sequences for the UOV Key Generation
351	On the Impossibility of Instantiating PSS in the Standard Model
369	On-line Non-transferable Signatures Revisited
387	Round-Efficient Sub-linear Zero-Knowledge Arguments for Linear Algebra
403	Signatures on Randomizable Ciphertexts
423	Revocation for Delegatable Anonymous Credentials
441	Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
459	Cryptanalysis of Cryptosystems Based on Non-commutative Skew Polynomials
473	Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem