21 search results - page 3 / 5 » Efficient Constructions of Composable Commitments and Zero-K... |
CRYPTO
1995
Springer
13 years 10 months ago
1995
Springer
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
STOC
2003
ACM
14 years 7 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...
ACNS
2007
Springer
13 years 11 months ago
2007
Springer
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
CTRSA
2006
Springer
13 years 10 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...