On the limitations of universally composable two-party computation without set-up assumptions
- Ran Canetti
- Eyal Kushilevitz
- et al.
- 2005
- Journal of Cryptology
Publications
Date
Featured collections
Popular topics
54 results at Journal of Cryptology
Random oracles in constantinople: Practical asynchronous Byzantine agreement using cryptography
- Christian Cachin
- Klaus Kursawe
- et al.
- 2005
- Journal of Cryptology
An improved pseudo-random generator based on the discrete logarithm problem
- Rosario Gennaro
- 2004
- Journal of Cryptology
Adaptive versus non-adaptive security of multi-party protocols
- Ran Canetti
- Ivan Damgård
- et al.
- 2004
- Journal of Cryptology
Paillier's trapdoor function hides up to O(n) bits
- Dario Catalano
- Rosario Gennaro
- et al.
- 2002
- Journal of Cryptology
OAEP Reconsidered
- Victor Shoup
- 2002
- Journal of Cryptology
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
- Victor Shoup
- Rosario Gennaro
- 2002
- Journal of Cryptology
Robust and efficient sharing of rsa functions
- Rosario Gennaro
- Tal Rabin
- 2000
- Journal of Cryptology
Security and composition of multiparty cryptographic protocols
- Ran Canetti
- 2000
- Journal of Cryptology
Maintaining authenticated communication in the presence of break-ins
- Ran Canetti
- Shai Halevi
- et al.
- 2000
- Journal of Cryptology