Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
From MaRDI portal
Publication:6157549
Recommendations
Cites work
- scientific article; zbMATH DE number 2081086 (Why is no real title available?)
- scientific article; zbMATH DE number 2086702 (Why is no real title available?)
- Automata, Languages and Programming
- Constructing confidential channels from authenticated channels-public-key encryption revisited
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Designated verifier proofs and their applications
- From Indifferentiability to Constructive Cryptography (and Back)
- GNUC: a new universal composability framework
- Indistinguishability Amplification
- Information Security
- Information Security and Cryptology - ICISC 2003
- Information and Communications Security
- On composable security for digital signatures
- Overcoming impossibility results in composable security using interval-wise guarantees
- Public Key Cryptography – PKC 2004
- Security in Communication Networks
- Stronger security and constructions of multi-designated verifier signatures
- The reactive simulatability (RSIM) framework for asynchronous systems
- Theory of Cryptography
- Universal designated-verifier signatures
- Universally Composable Security with Global Setup
- Universally composable incoercibility
Cited in
(4)
This page was built for publication: Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157549)