3228 search results - page 147 / 646 » Computationally Sound Proofs |
ESORICS
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
PODC
2005
ACM
14 years 3 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
STOC
2006
ACM
14 years 10 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...
FOCS
2002
IEEE
14 years 3 months ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
BIRTHDAY
2010
Springer
13 years 10 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...