On Deniability in the Common Reference String and Random Oracle Model
Author:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 316-337
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Strict polynomial-time in simulation and extraction2002
- Universally composable two-party and multi-party secure computation2002
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many RoundsSIAM Journal on Computing, 2002
- Universally Composable Commitments2001
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols2001
- Universally composable security: a new paradigm for cryptographic protocols2001
- The random oracle methodology, revisited (preliminary version)1998
- Random oracles are practical1993
- Undeniable Signatures1990
- Non-interactive zero-knowledge and its applications1988