769 search results - page 12 / 154 » Where Is the Proof |
JAR
1998
13 years 7 months ago
1998
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
PKC
2009
Springer
14 years 1 days ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
ICSE
2000
IEEE-ACM
13 years 11 months ago
2000
IEEE-ACM
This paper presents a technique for incrementally constructing safety specifications, abstract algorithm descriptions, and simulation proofs showing that algorithms meet their spe...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
PODC
2005
ACM
14 years 1 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...