860 search results - page 63 / 172 » Completeness in two-party secure computation: a computationa... |
159
click to vote
CRYPTO
2009
Springer
16 years 22 days ago
2009
Springer
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
303
click to vote
CADE
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
178
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
263
click to vote
COLCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
With the widespread adoption of XML as the message format to disseminate content over distributed systems including Web Services and Publish-Subscribe systems, different methods ha...
146
click to vote
CSE
2009
IEEE
16 years 27 days ago
2009
IEEE
— Data centers accumulate corporate and personal data at a rapid pace. Driven by economy of scale and the high bandwidth of today’s network connections, more and more businesse...