Sciweavers

351 search results - page 20 / 71
» Classical proof forestry
Sort
View
TCC
2010
Springer
178views Cryptology» more  TCC 2010»
14 years 4 months ago
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
Rikke Bendlin, Ivan Damgård
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
14 years 2 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
MLQ
2010
99views more  MLQ 2010»
13 years 6 months ago
Proof interpretations with truth
This article systematically investigates so-called “truth variants” of several functional interpretations. We start by showing a close relation between two variants of modifi...
Jaime Gaspar, Paulo Oliva
CIE
2005
Springer
14 years 1 months ago
A Logical Approach to Abstract Algebra
L APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI Recent work in constructive mathematics show that Hilbert’s program works rge part of abstract algebra. Using in...
Thierry Coquand
STOC
1990
ACM
93views Algorithms» more  STOC 1990»
13 years 11 months ago
Perfect Zero-Knowledge in Constant Rounds
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
Mihir Bellare, Silvio Micali, Rafail Ostrovsky