Sciweavers

37 search results - page 4 / 8
» tcc 2009
Sort
View
TCC
2009
Springer
158views Cryptology» more  TCC 2009»
14 years 6 months ago
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
Iftach Haitner, Alon Rosen, Ronen Shaltiel
TCC
2009
Springer
142views Cryptology» more  TCC 2009»
14 years 6 months ago
Chosen-Ciphertext Security via Correlated Products
We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs ...
Alon Rosen, Gil Segev
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
14 years 6 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
TCC
2009
Springer
116views Cryptology» more  TCC 2009»
14 years 6 months ago
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...
Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 6 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai