Sciweavers

1662 search results - page 50 / 333
» Privately Finding Specifications
Sort
View
123
Voted
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 3 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 3 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
131
Voted
SIGIR
2006
ACM
15 years 9 months ago
You are what you say: privacy risks of public mentions
In today’s data-rich networked world, people express many aspects of their lives online. It is common to segregate different aspects in different places: you might write opinion...
Dan Frankowski, Dan Cosley, Shilad Sen, Loren G. T...
143
Voted
DSN
2004
IEEE
15 years 7 months ago
Diverse Firewall Design
Firewalls are the mainstay of enterprise security and the most widely adopted technology for protecting private networks. An error in a firewall policy either creates security hole...
Alex X. Liu, Mohamed G. Gouda
CCS
2010
ACM
15 years 3 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...