Sciweavers

608 search results - page 21 / 122
» Interactive Oracle Proofs
Sort
View
ASIACRYPT
2007
Springer
14 years 1 months ago
A Non-interactive Shuffle with Pairing Based Verifiability
A shuffle is a permutation and re-encryption of a set of ciphertexts. Shuffles are for instance used in mix-nets for anonymous broadcast and voting. One way to make a shuffle verif...
Jens Groth, Steve Lu
CADE
2004
Springer
14 years 10 months ago
Experiments on Supporting Interactive Proof Using Resolution
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
Jia Meng, Lawrence C. Paulson
JAR
2007
85views more  JAR 2007»
13 years 9 months ago
User Interaction with the Matita Proof Assistant
Matita is a new, document-centric, tactic-based interactive theorem prover. This paper focuses on some of the distinctive features of the user interaction with Matita, characterize...
Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tas...
ICFP
2009
ACM
14 years 10 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
HIP
2005
Springer
208views Cryptology» more  HIP 2005»
14 years 3 months ago
Phish and HIPs: Human Interactive Proofs to Detect Phishing Attacks
In this paper, we propose a new class of Human Interactive Proofs (HIPs) that allow a human to distinguish one computer from another. Unlike traditional HIPs, where the computer is...
Rachna Dhamija, J. D. Tygar