Sciweavers

978 search results - page 79 / 196
» Knowledge, Probability, and Adversaries
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 1 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
CORR
2010
Springer
121views Education» more  CORR 2010»
14 years 10 months ago
GNSS-based positioning: Attacks and Countermeasures
Increasing numbers of mobile computing devices, user-portable, or embedded in vehicles, cargo containers, or the physical space, need to be aware of their location in order to prov...
P. Papadimitratos, A. Jovanovic
ICDCN
2011
Springer
14 years 1 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
KR
2010
Springer
15 years 2 months ago
Probabilistic Description Logics for Subjective Uncertainty
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
Carsten Lutz, Lutz Schröder
TARK
2007
Springer
15 years 4 months ago
Dealing with logical omniscience
We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and imposs...
Joseph Y. Halpern, Riccardo Pucella