Sciweavers

11 search results - page 1 / 3
» New Constructions for UC Secure Computation Using Tamper-Pro...
Sort
View
EUROCRYPT
2008
Springer
13 years 6 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
EUROCRYPT
2007
Springer
13 years 10 months ago
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
Jonathan Katz
ICS
2010
Tsinghua U.
14 years 1 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
14 years 4 months ago
LEGO for Two-Party Secure Computation
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
Jesper Buus Nielsen, Claudio Orlandi
ESORICS
2006
Springer
13 years 8 months ago
Private Information Retrieval Using Trusted Hardware
Abstract. Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impract...
Shuhong Wang, Xuhua Ding, Robert H. Deng, Feng Bao