Extending Oblivious Transfers Efficiently
- 1 January 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption ProblemLecture Notes in Computer Science, 2004
- The Security of Cipher Block ChainingPublished by Springer Science and Business Media LLC ,2001
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- The random oracle methodology, revisited (preliminary version)Published by Association for Computing Machinery (ACM) ,1998
- A construction of a cipher from a single pseudorandom permutationJournal of Cryptology, 1997
- Correlated pseudorandomness and the complexity of private computationsPublished by Association for Computing Machinery (ACM) ,1996
- Optimal asymmetric encryptionLecture Notes in Computer Science, 1995
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Equivalence Between Two Flavours of Oblivious TransfersLecture Notes in Computer Science, 1988
- A randomized protocol for signing contractsCommunications of the ACM, 1985