Sciweavers

105 search results - page 9 / 21
» Simple, Black-Box Constructions of Adaptively Secure Protoco...
Sort
View
EUROCRYPT
2007
Springer
15 years 1 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
MSN
2007
Springer
162views Sensor Networks» more  MSN 2007»
15 years 3 months ago
Adaptive Topology Based Gossiping in VANETs Using Position Information
Abstract. Gossiping is a lightweight and simple technique for information dissemination in many application domains, be it in Wireless Sensor Networks (WSNs), Mobile Ad-hoc Network...
Boto Bako, Igor Rikanovic, Frank Kargl, Elmar Scho...
EUROCRYPT
2004
Springer
15 years 3 months ago
Chosen-Ciphertext Security from Identity-Based Encryption
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
Ran Canetti, Shai Halevi, Jonathan Katz
79
Voted
INFOCOM
2010
IEEE
14 years 8 months ago
Castor: Scalable Secure Routing for Ad Hoc Networks
—Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have b...
Wojciech Galuba, Panos Papadimitratos, Marcin Potu...
SEC
2001
14 years 11 months ago
Communication-Efficient Group Key Agreement
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
Yongdae Kim, Adrian Perrig, Gene Tsudik