169 search results - page 6 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
PLDI
2009
ACM
14 years 8 months ago
2009
ACM
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
FMOODS
2003
13 years 9 months ago
2003
A way to write proof scores showing that distributed systems have invariant properties in algebraic speciļ¬cation languages is described, which has been devised through several ca...
ASM
2010
ASM
13 years 10 months ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...