1401 search results - page 19 / 281 » Randomness in Interactive Proofs |
104
click to vote
JOC
2007
14 years 9 months ago
2007
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
COMBINATORICS
2000
14 years 9 months ago
2000
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...
CTRSA
2001
Springer
15 years 2 months ago
2001
Springer
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
AICOM
2010
14 years 9 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...