305 search results - page 37 / 61 » From Sets to Bits in Coq |
ITC
2003
IEEE
15 years 4 months ago
2003
IEEE
A fault fj is said to dominate another fault fi if all tests for fi detect fj . When two faults dominate each other, they are called equivalent. Dominance and equivalence relation...
129
Voted
PODC
2012
ACM
13 years 1 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
82
Voted
TCC
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
116
click to vote
ASIAN
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...