Sciweavers

1656 search results - page 191 / 332
» Secure Computation Without Authentication
Sort
View
ICALP
2005
Springer
14 years 3 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
VLDB
2006
ACM
122views Database» more  VLDB 2006»
14 years 10 months ago
A secure distributed framework for achieving k-anonymity
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...
Wei Jiang, Chris Clifton
ICNP
2002
IEEE
14 years 3 months ago
A Secure Routing Protocol for Ad Hoc Networks
Most recent ad hoc network research has focused on providing routing services without considering security. In this paper, we detail security threats against ad hoc routing protoc...
Kimaya Sanzgiri, Bridget Dahill, Brian Neil Levine...
IACR
2011
147views more  IACR 2011»
12 years 10 months ago
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
Zhenfu Cao, Zongyang Zhang, Yunlei Zhao
TIT
2011
125views more  TIT 2011»
13 years 5 months ago
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
Benoît Libert, Damien Vergnaud