Sciweavers

139 search results - page 26 / 28
» Zero-Knowledge
Sort
View
PODC
2011
ACM
14 years 3 months ago
Securing social networks
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...
Michael Backes, Matteo Maffei, Kim Pecina
83
Voted
IACR
2011
88views more  IACR 2011»
14 years 10 days ago
Targeted Malleability: Homomorphic Encryption for Restricted Computations
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
Dan Boneh, Gil Segev, Brent Waters
87
Voted
IACR
2011
97views more  IACR 2011»
14 years 10 days ago
Two-Output Secure Computation with Malicious Adversaries
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
Abhi Shelat, Chih-Hao Shen
128
Voted
IACR
2011
105views more  IACR 2011»
14 years 10 days ago
Leakage Tolerant Interactive Protocols
We put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage to...
Nir Bitansky, Ran Canetti, Shai Halevi
80
Voted
EUROCRYPT
2009
Springer
16 years 1 months ago
On the Portability of Generalized Schnorr Proofs
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
Jan Camenisch, Aggelos Kiayias, Moti Yung