60 search results - page 10 / 12 » Zero knowledge with efficient provers |
ACNS
2009
Springer
13 years 9 months ago
2009
Springer
Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicio...
STOC
2002
ACM
14 years 6 months 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...
IJCAI
2001
13 years 7 months ago
2001
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
PKC
2000
Springer
13 years 9 months ago
2000
Springer
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...