Sciweavers

PKC
2015
Springer
30views Cryptology» more  PKC 2015»
9 years 8 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
20views Cryptology» more  PKC 2015»
9 years 8 months ago
Predicate Encryption for Multi-dimensional Range Queries from Lattices
Abstract. We construct a lattice-based predicate encryption scheme for multi-dimensional range and multidimensional subset queries. Our scheme is selectively secure and weakly attr...
Romain Gay, Pierrick Méaux, Hoeteck Wee
PKC
2015
Springer
14views Cryptology» more  PKC 2015»
9 years 8 months ago
Digital Signatures from Strong RSA without Prime Generation
Abstract. We construct a signature scheme that is proved secure, without random oracles, under the strong RSA assumption. Unlike other efficient strong-RSA based schemes, the new ...
David Cash, Rafael Dowsley, Eike Kiltz
PKC
2015
Springer
14views Cryptology» more  PKC 2015»
9 years 8 months ago
How Secure is Deterministic Encryption?
Mihir Bellare, Rafael Dowsley, Sriram Keelveedhi
PKC
2015
Springer
18views Cryptology» more  PKC 2015»
9 years 8 months ago
On the Practical Security of Inner Product Functional Encryption
Functional Encryption (FE) is an exciting new paradigm that extends the notion of public key encryption. In this work we explore the security of Inner Product Functional Encryptio...
Shashank Agrawal, Shweta Agrawal, Saikrishna Badri...
Cryptology
Top of PageReset Settings