Sciweavers

Share
PKC
2015
Springer
17views Cryptology» more  PKC 2015»
4 years 7 months ago
Adaptive Proofs of Knowledge in the Random Oracle Model
We formalise the notion of adaptive proofs of knowledge in the random oracle model, where the extractor has to recover witnesses for multiple, possibly adaptively chosen statements...
David Bernhard, Marc Fischlin, Bogdan Warinschi
PKC
2015
Springer
27views Cryptology» more  PKC 2015»
4 years 7 months ago
Simulation-Based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms
We study simulation-based, selective opening security against chosen-ciphertext attacks (SIM-SO-CCA security) for public key encryption (PKE). In a selective opening, chosen-cipher...
Shengli Liu, Kenneth G. Paterson
PKC
2015
Springer
30views Cryptology» more  PKC 2015»
4 years 7 months ago
Additively Homomorphic UC Commitments with Optimal Amortized Overhead
We propose the first UC secure commitment scheme with (amortized) computational complexity linear in the size of the string committed to. After a preprocessing phase based on obli...
Ignacio Cascudo, Ivan Damgård, Bernardo Mach...
PKC
2015
Springer
12views Cryptology» more  PKC 2015»
4 years 7 months ago
A Polynomial-Time Attack on the BBCRS Scheme
The BBCRS scheme is a variant of the McEliece public-key encryption scheme where the hiding phase is performed by taking the inverse of a matrix which is of the form T +R where T i...
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich,...
books