Automata, Languages and Programming
From MaRDI portal
Publication:5716797
DOI10.1007/11523468zbMath1082.94542WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716797
Helger Lipmaa, Guilin Wang, Feng Bao
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
signature scheme; non-programmable random oracle model; non-delegatability; Designated verifier signature scheme
94A62: Authentication, digital signatures and secret sharing
Related Items
Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures, Designated-verifier linkable ring signatures with unconditional anonymity, Anonymous yet Traceable Strong Designated Verifier Signature, Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework), On delegatability of designated verifier signature schemes, An ID-based multi-signer universal designated multi-verifier signature scheme, A short non-delegatable strong designated verifier signature, Provably secure and pairing-based strong designated verifier signature scheme with message recovery, Policy controlled system with anonymity, Universal designated verifier signature scheme with non-delegatability in the standard model, Designated-verifier linkable ring signatures, Multi-designated receiver signed public key encryption, A novel ID-based designated verifier signature scheme, A strong designated verifier signature scheme tightly related to the LRSW assumption
