Sciweavers

53 search results - page 1 / 11
» Secure Commitment Against A Powerful Adversary
Sort
View
STACS
1992
Springer
13 years 9 months ago
Secure Commitment Against A Powerful Adversary
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...
Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yun...
SCN
2008
Springer
142views Communications» more  SCN 2008»
13 years 5 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart
ACSAC
2008
IEEE
13 years 11 months ago
PAS: Predicate-Based Authentication Services Against Powerful Passive Adversaries
Securely authenticating a human user without assistance from any auxiliary device in the presence of powerful passive adversaries is an important and challenging problem. Passive ...
Xiaole Bai, Wenjun Gu, Sriram Chellappan, Xun Wang...
TCC
2009
Springer
116views Cryptology» more  TCC 2009»
14 years 5 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
EUROCRYPT
1999
Springer
13 years 9 months ago
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
Ivan Damgård, Joe Kilian, Louis Salvail