13383 search results - page 100 / 2677 » Abstractions from proofs |
227
Voted
ASIACRYPT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standa...
131
Voted
WDAG
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
150
Voted
CADE
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
122
Voted
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
125
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...