19 search results - page 3 / 4 » Succinct NP Proofs from an Extractability Assumption |
LPAR
2007
Springer
14 years 1 months ago
2007
Springer
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
ICALP
2010
Springer
14 years 4 days ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
CRYPTO
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
LICS
2003
IEEE
14 years 18 days ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
AFRICACRYPT
2010
Springer
14 years 14 days ago
2010
Springer
the full version of the extended abstract which appears in Africacrypt ’10 (3 – 6 may 2010, Stellenbosch, South Africa) D. Bernstein and T. Lange Eds., Springer-Verlag, LNCS 60...