Composability and On-Line Deniability of Authentication
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 146-162
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Universally Composable Security with Global Setup2007
- Zaps and Their ApplicationsSIAM Journal on Computing, 2007
- On the Limitations of Universally Composable Two-Party Computation Without Set-Up AssumptionsJournal of Cryptology, 2005
- Deniable Authenticated Key Establishment for Internet ProtocolsLecture Notes in Computer Science, 2005
- Concurrent zero-knowledgeJournal of the ACM, 2004
- Non-interactive Deniable Ring Authentication2004
- Universal Composition with Joint State2003
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many RoundsSIAM Journal on Computing, 2002
- Nonmalleable CryptographySIAM Journal on Computing, 2000
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989