Sciweavers

731 search results - page 51 / 147
» New Security Results on Encrypted Key Exchange
Sort
View
CCS
2005
ACM
14 years 4 months ago
Untraceable RFID tags via insubvertible encryption
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain u...
Giuseppe Ateniese, Jan Camenisch, Breno de Medeiro...
IJNSEC
2007
131views more  IJNSEC 2007»
13 years 10 months ago
An Asymmetric Cryptographic Key Assignment Scheme for Access Control in Tree Structural Hierarchies
In a hierarchical structure, a user in a security class has access to information items of another class if and only if the former class is a predecessor of latter. Based upon cry...
Debasis Giri, Parmeshwary Dayal Srivastava
CRYPTO
2010
Springer
197views Cryptology» more  CRYPTO 2010»
13 years 12 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
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 11 months ago
Simultaneous scalability and security for data-intensive web applications
For Web applications in which the database component is the bottleneck, scalability can be provided by a third-party Database Scalability Service Provider (DSSP) that caches appli...
Amit Manjhi, Anastassia Ailamaki, Bruce M. Maggs, ...
EUROCRYPT
2004
Springer
14 years 4 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer