Sciweavers

Share
14 search results - page 1 / 3
» New Constructions for UC Secure Computation Using Tamper-Pro...
Sort
View
EUROCRYPT
2008
Springer
8 years 5 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
8 years 9 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
IACR
2016
43views Biometrics» more  IACR 2016»
2 years 11 months ago
Rate-1, Linear Time and Additively Homomorphic UC Commitments
We propose the first UC commitment scheme for binary strings with the optimal properties of rate approaching 1 and linear time (in the amortised sense, using a small number of see...
Ignacio Cascudo, Ivan Damgård, Bernardo Davi...
TCC
2016
Springer
77views Cryptology» more  TCC 2016»
2 years 11 months ago
On the Complexity of Additively Homomorphic UC Commitments
We present a new constant round additively homomorphic commitment scheme with (amortized) computational and communication complexity linear in the size of the string committed to. ...
Tore Kasper Frederiksen, Thomas P. Jakobsen, Jespe...
ICS
2010
Tsinghua U.
9 years 25 days 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...
books