Universally Composable Undeniable Signature
From MaRDI portal
Publication:3519530
DOI10.1007/978-3-540-70583-3_43zbMath1155.94398OpenAlexW1514313564MaRDI QIDQ3519530
Publication date: 19 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_43
Related Items (6)
Universal Composition with Responsive Environments ⋮ Universally Composable Undeniable Signature ⋮ Short undeniable signatures based on group homomorphisms ⋮ A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort ⋮ Efficient post-quantum undeniable signature on 64-bit ARM ⋮ New Constructions and Applications of Trapdoor DDH Groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient undeniable signature schemes based on ideal arithmetic in quadratic orders
- RSA-based undeniable signatures
- New Convertible Undeniable Signature Schemes
- Undeniable Signatures
- Universally Composable Undeniable Signature
- Relations Among Security Notions for Undeniable Signature Schemes
- The security of the FDH variant of Chaum's undeniable signature scheme
- Universally composable two-party and multi-party secure computation
- Convertible Undeniable Signatures
- Short Undeniable Signatures Without Random Oracles: The Missing Link
- New Approach for Selectively Convertible Undeniable Signature Schemes
- Generic Homomorphic Undeniable Signatures
- Topics in Cryptology – CT-RSA 2004
This page was built for publication: Universally Composable Undeniable Signature