Sciweavers

51 search results - page 9 / 11
» Efficient Public Key Encryption Based on Ideal Lattices
Sort
View
ACSAC
2009
IEEE
13 years 11 months ago
BAF: An Efficient Publicly Verifiable Secure Audit Logging Scheme for Distributed Systems
Audit logs, providing information about the current and past states of systems, are one of the most important parts of modern computer systems. Providing security for audit logs on...
Attila Altay Yavuz, Peng Ning
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...
ICON
2007
IEEE
14 years 1 months ago
A Location-aware Key Predistribution Scheme for Distributed Wireless Sensor Networks
Key establishment plays a central role in authentication and encryption in wireless sensor networks, especially when they are mainly deployed in hostile environments. Because of th...
Ngo Trong Canh, Tran Van Phuong, Young-Koo Lee, Su...
ITIIS
2010
200views more  ITIIS 2010»
13 years 2 months ago
New Techniques for Anonymous HIBE with Short Ciphertexts in Prime Order Groups
Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key...
Kwangsu Lee, Dong Hoon Lee
JOC
2010
82views more  JOC 2010»
13 years 2 months ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
Jens Groth