Sciweavers

132 search results - page 14 / 27
» New and improved constructions of non-malleable cryptographi...
Sort
View
TDP
2010
166views more  TDP 2010»
13 years 2 months ago
Communication-Efficient Privacy-Preserving Clustering
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
PODC
2003
ACM
14 years 1 months ago
Oblivious signature-based envelope
We propose a new cryptographic primitive called oblivious signaturebased envelope (OSBE). Informally, an OSBE scheme enables a sender to send an envelope (encrypted message) to a ...
Ninghui Li, Wenliang Du, Dan Boneh
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
13 years 12 months ago
Universal Accumulators with Efficient Nonmembership Proofs
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
Jiangtao Li, Ninghui Li, Rui Xue
MOBIQUITOUS
2005
IEEE
14 years 1 months ago
SRDP: Securing Route Discovery in DSR
Routing is a critical function in multi-hop mobile ad hoc networks (MANETs). A number of MANET-oriented routing protocols have been proposed, of which DSR is widely considered bot...
Jihye Kim, Gene Tsudik