1274 search results - page 65 / 255 » New Proofs for |
108
click to vote
IACR
2011
14 years 8 days ago
2011
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
120
Voted
ENTCS
2002
15 years 10 days ago
2002
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
BIRTHDAY
2007
Springer
15 years 6 months ago
2007
Springer
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...
125
Voted
ASIACRYPT
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
CTRSA
2009
Springer
15 years 7 months ago
2009
Springer
Zero-knowledge set is a primitive introduced by Micali, Rabin, and Kilian (FOCS 2003) which enables a prover to commit a set to a verifier, without revealing even the size of the...