610 search results - page 10 / 122 » Information-theoretically secure protocols and security unde... |
84
Voted
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
EUROCRYPT
2007
Springer
15 years 1 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
FC
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
CSFW
1999
IEEE
15 years 1 months ago
1999
IEEE
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
ESORICS
2006
Springer
15 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...