Lower Bounds for Concurrent Self Composition
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On the Limitations of Universally Composable Two-Party Computation without Set-up AssumptionsPublished by Springer Nature ,2003
- Universally composable two-party and multi-party secure computationPublished by Association for Computing Machinery (ACM) ,2002
- Universally Composable CommitmentsPublished by Springer Nature ,2001
- Fair Computation of General Functions in Presence of Immoral MajorityPublished by Springer Nature ,2001
- Foundations of Secure Interactive ComputingPublished by Springer Nature ,2001
- How to go beyond the black-box simulation barrierPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Universally composable security: a new paradigm for cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- Concurrent zero-knowledgePublished by Association for Computing Machinery (ACM) ,1998
- Protocol interactions and the chosen protocol attackPublished by Springer Nature ,1998