Sciweavers

113 search results - page 1 / 23
» Correcting errors without leaking partial information
Sort
View
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 4 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
SIGCOMM
2010
ACM
13 years 4 months ago
Efficient error estimating coding: feasibility and applications
Motivated by recent emerging systems that can leverage partially correct packets in wireless networks, this paper investigates the novel concept of error estimating codes (EEC). W...
Binbin Chen, Ziling Zhou, Yuda Zhao, Haifeng Yu
CCS
2007
ACM
13 years 10 months ago
How much anonymity does network latency leak?
Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by “local” adversaries who control ...
Nicholas Hopper, Eugene Y. Vasserman, Eric Chan-Ti...
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 4 months ago
Network Codes Resilient to Jamming and Eavesdropping
Abstract--We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious err...
Hongyi Yao, Danilo Silva, Sidharth Jaggi, Michael ...
EUROCRYPT
2007
Springer
13 years 10 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...