38 search results - page 6 / 8 » Universally Composable Protocols with Relaxed Set-Up Assumpt... |
CRYPTO
2005
Springer
14 years 3 months ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
IACR
2011
12 years 9 months ago
2011
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To t...
CCS
2007
ACM
14 years 4 months ago
2007
ACM
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
EUROCRYPT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
ESORICS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositio...