Sciweavers

978 search results - page 3 / 196
» Knowledge, Probability, and Adversaries
Sort
View
CORR
2011
Springer
200views Education» more  CORR 2011»
14 years 6 months ago
Beating the Gilbert-Varshamov Bound for Online Channels
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
Ishay Haviv, Michael Langberg
CORR
2006
Springer
104views Education» more  CORR 2006»
14 years 11 months ago
Modeling Adversaries in a Logic for Security Protocol Analysis
Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which c...
Joseph Y. Halpern, Riccardo Pucella
ICDE
2010
IEEE
235views Database» more  ICDE 2010»
15 years 11 months ago
Privacy in Data Publishing
Privacy in data publishing has received much attention recently. The key to defining privacy is to model knowledge of the attacker ? if the attacker is assumed to know too little,...
Johannes Gehrke, Daniel Kifer, Ashwin Machanavajjh...
GC
2004
Springer
15 years 5 months ago
Towards a Formal Treatment of Secrecy Against Computational Adversaries
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
Angelo Troina, Alessandro Aldini, Roberto Gorrieri
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 7 days ago
Relationship privacy: output perturbation for queries with joins
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
Vibhor Rastogi, Michael Hay, Gerome Miklau, Dan Su...