Sciweavers

793 search results - page 88 / 159
» Argumentation and standards of proof
Sort
View
ACNS
2009
Springer
121views Cryptology» more  ACNS 2009»
14 years 3 months ago
Efficient Deniable Authentication for Signatures
Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicio...
Jean Monnerat, Sylvain Pasini, Serge Vaudenay
ICLP
2010
Springer
14 years 2 months ago
Dedicated Tabling for a Probabilistic Setting
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
Theofrastos Mantadelis, Gerda Janssens
MST
2010
122views more  MST 2010»
13 years 5 months ago
Self-Referential Justifications in Epistemic Logic
This paper is devoted to the study of self-referential proofs and/or justifications, i.e., valid proofs that prove statements about these same proofs. The goal is to investigate wh...
Roman Kuznets
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 8 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
14 years 3 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...