Sciweavers

152 search results - page 11 / 31
» Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
Sort
View
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
CCR
2000
101views more  CCR 2000»
15 years 8 days ago
Knowledge-proof based versatile smart card verification protocol
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
Dae Hun Nyang, Joo-Seok Song
DATESO
2009
101views Database» more  DATESO 2009»
14 years 10 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
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
105
Voted
CORR
2002
Springer
108views Education» more  CORR 2002»
15 years 8 days ago
Vote Elicitation: Complexity and Strategy-Proofness
Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has receive...
Vincent Conitzer, Tuomas Sandholm