Sciweavers

793 search results - page 46 / 159
» Argumentation and standards of proof
Sort
View
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
15 years 2 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan
107
Voted
LPAR
2010
Springer
14 years 10 months ago
On the Equality of Probabilistic Terms
We consider a mild extension of universal algebra in which terms are built both from deterministic and probabilistic variables, and are interpreted as distributions. We formulate a...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
NMR
2004
Springer
15 years 6 months ago
Preferential defeasibility: utility in defeasible logic programming
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
Fernando A. Tohmé, Guillermo Ricardo Simari
148
Voted
ASIAN
2009
Springer
334views Algorithms» more  ASIAN 2009»
15 years 1 months ago
A Dolev-Yao Model for Zero Knowledge
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh
CAV
2011
Springer
234views Hardware» more  CAV 2011»
14 years 4 months ago
Resolution Proofs and Skolem Functions in QBF Evaluation and Applications
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
Valeriy Balabanov, Jie-Hong R. Jiang