152 search results - page 15 / 31 » Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use |
140
click to vote
CTRSA
2011
Springer
14 years 4 months ago
2011
Springer
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...
STOC
2002
ACM
16 years 23 days ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
98
Voted
CHI
2005
ACM
15 years 2 months ago
2005
ACM
HIPs, or Human Interactive Proofs, are challenges meant to be easily solved by humans, while remaining too hard to be economically solved by computers. HIPs are increasingly used ...
148
click to vote
EUROCRYPT
2008
Springer
15 years 2 months ago
2008
Springer
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
98
Voted
IIWAS
2003
15 years 1 months ago
2003
A question based knowledge management system with the capability to integrate heterogeneous sources of information and knowledge and which nonetheless acts like a single coherent ...