Sciweavers

978 search results - page 19 / 196
» Knowledge, Probability, and Adversaries
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 8 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
EUROCRYPT
2008
Springer
13 years 9 months ago
Isolated Proofs of Knowledge and Isolated Zero Knowledge
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
ICDT
2010
ACM
172views Database» more  ICDT 2010»
14 years 6 days ago
k-jump strategy for preserving privacy in micro-data disclosure
In disclosing micro-data with sensitive attributes, the goal is usually two fold. First, the data utility of disclosed data should be maximized for analysis purposes. Second, the ...
Wen Ming Liu, Lingyu Wang, Lei Zhang
ISIPTA
1999
IEEE
103views Mathematics» more  ISIPTA 1999»
13 years 11 months ago
A Review of Propagation Algorithms for Imprecise Probabilities
This paper reviews algorithms for local computation with imprecise probabilities. These algorithms try to solve problems of inference calculation of conditional or unconditional p...
Andrés Cano, Serafín Moral
FLAIRS
2008
13 years 9 months ago
Toward Markov Logic with Conditional Probabilities
Combining probability and first-order logic has been the subject of intensive research during the last ten years. The most well-known formalisms combining probability and some sub...
Jens Fisseler