8 search results - page 2 / 2 » Efficient k-out-of-n Oblivious Transfer Schemes |
SCN
2008
Springer
13 years 4 months ago
2008
Springer
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...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...