Sciweavers

35 search results - page 4 / 7
» Trapdoors for Hard Lattices and New Cryptographic Constructi...
Sort
View
CRYPTO
2010
Springer
197views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
We present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, we construct...
Shweta Agrawal, Dan Boneh, Xavier Boyen
ISW
2010
Springer
13 years 5 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
IACR
2011
173views more  IACR 2011»
12 years 7 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz
PKC
2012
Springer
279views Cryptology» more  PKC 2012»
11 years 9 months ago
Circular and KDM Security for Identity-Based Encryption
We initiate the study of security for key-dependent messages (KDM), sometimes also known as “circular” or “clique” security, in the setting of identity-based encryption (I...
Jacob Alperin-Sheriff, Chris Peikert
ASIACRYPT
2009
Springer
14 years 2 months ago
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...