1401 search results - page 25 / 281 » Randomness in Interactive Proofs |
123
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
106
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
107
Voted
DCC
2010
IEEE
15 years 2 months ago
2010
IEEE
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
107
click to vote
IJCAI
1997
15 years 3 months ago
1997
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...
117
click to vote
TPHOL
1999
IEEE
15 years 6 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...