Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
From MaRDI portal
Publication:6157549
DOI10.1007/978-3-030-92078-4_7zbMATH Open1514.94117OpenAlexW3202225473MaRDI QIDQ6157549FDOQ6157549
Authors: Ueli M. Maurer, Christopher Portmann, Guilherme Rito
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/520644
Recommendations
Cites Work
- GNUC: a new universal composability framework
- Title not available (Why is that?)
- Title not available (Why is that?)
- Public Key Cryptography – PKC 2004
- Universal designated-verifier signatures
- Universally composable incoercibility
- Designated verifier proofs and their applications
- Information and Communications Security
- Security in Communication Networks
- Information Security and Cryptology - ICISC 2003
- Universally Composable Security with Global Setup
- Theory of Cryptography
- Automata, Languages and Programming
- The reactive simulatability (RSIM) framework for asynchronous systems
- Indistinguishability Amplification
- Constructive cryptography -- a new paradigm for security definitions and proofs
- On composable security for digital signatures
- Stronger security and constructions of multi-designated verifier signatures
- From Indifferentiability to Constructive Cryptography (and Back)
- Constructing confidential channels from authenticated channels-public-key encryption revisited
- Overcoming impossibility results in composable security using interval-wise guarantees
- Information Security
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)