1401 search results - page 24 / 281 » Randomness in Interactive Proofs |
ENTCS
2000
14 years 9 months ago
2000
The NuPRL system [3] was designed for interactive writing of machine
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
CSL
2005
Springer
15 years 3 months ago
2005
Springer
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying...
112
Voted
PAIRING
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...