Sciweavers

469 search results - page 22 / 94
» Using Secret Sharing for Searching in Encrypted Data
Sort
View
FOCS
2002
IEEE
14 years 21 days ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
SPW
2005
Springer
14 years 1 months ago
Repairing the Bluetooth Pairing Protocol
Abstract. We implement and demonstrate a passive attack on the Bluetooth authentication protocol used to connect two devices to each other. Using a protocol analyzer and a brute-fo...
Frank Stajano
IACR
2011
139views more  IACR 2011»
12 years 7 months ago
Improved Meet-in-the-Middle Cryptanalysis of KTANTAN
We revisit meet-in-the-middle attacks on block ciphers and recent developments in meet-in-the-middle preimage attacks on hash functions. Despite the presence of a secret key in the...
Lei Wei, Christian Rechberger, Jian Guo 0001, Hong...
CCS
2010
ACM
13 years 8 months ago
Hierarchical attribute-based encryption for fine-grained access control in cloud storage services
Cloud computing, as an emerging computing paradigm, enables users to remotely store their data into a cloud so as to enjoy scalable services on-demand. Especially for small and me...
Guojun Wang, Qin Liu, Jie Wu
MOBISYS
2005
ACM
14 years 7 months ago
Shake them up!: a movement-based pairing protocol for CPU-constrained devices
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
Claude Castelluccia, Pars Mutaf