Sciweavers

195 search results - page 12 / 39
» Security and Privacy Using One-Round Zero-Knowledge Proofs
Sort
View
CCS
2006
ACM
15 years 3 months ago
Ring signatures without random oracles
Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the ra...
Sherman S. M. Chow, Victor K.-W. Wei, Joseph K. Li...
TCC
2009
Springer
158views Cryptology» more  TCC 2009»
16 years 8 days ago
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
Iftach Haitner, Alon Rosen, Ronen Shaltiel
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
14 years 3 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
ESORICS
2006
Springer
15 years 3 months ago
Privacy-Preserving Queries on Encrypted Data
Data confidentiality is a major concern in database systems. Encryption is a useful tool for protecting the confidentiality of sensitive data. However, when data is encrypted, perf...
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
CCS
2003
ACM
15 years 5 months ago
Secure protocol composition
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
Anupam Datta, Ante Derek, John C. Mitchell, Dusko ...