Sciweavers

426 search results - page 13 / 86
» Specification, Abduction, and Proof
Sort
View
ASIACRYPT
2010
Springer
13 years 8 months ago
Short Non-interactive Zero-Knowledge Proofs
We show that probabilistically checkable proofs can be used to shorten non-interactive zero-knowledge proofs. We obtain publicly verifiable non-interactive zero-knowledge proofs fo...
Jens Groth
ENTCS
2006
169views more  ENTCS 2006»
13 years 10 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
EUROCRYPT
2000
Springer
14 years 1 months ago
Efficient Proofs that a Committed Number Lies in an Interval
Alice wants to prove that she is young enough to borrow money from her bank, without revealing her age. She therefore needs a tool for proving that a committed number lies in a spe...
Fabrice Boudot
ISSTA
2000
ACM
14 years 2 months ago
Classification schemes to aid in the analysis of real-time systems
This paper presents three sets of classification schemes for processes, properties, and transitions that can be used to assist in the analysis of real-time systems. These classifi...
Paul Z. Kolano, Richard A. Kemmerer
IANDC
2008
81views more  IANDC 2008»
13 years 10 months ago
Universal extensions to simulate specifications
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...
Wim H. Hesselink