Legally Fair Contract Signing Without Keystones
From MaRDI portal
Publication:2822672
DOI10.1007/978-3-319-39555-5_10zbMath1346.94142OpenAlexW2476278545WikidataQ56920947 ScholiaQ56920947MaRDI QIDQ2822672
David Naccache, Houda Ferradi, Diana Maimuţ, David Pointcheval, Rémi Géraud
Publication date: 4 October 2016
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01377993/file/363.pdf
Related Items (1)
Cites Work
- On the fly authentication and signature schemes based on groups of unknown order
- Designated Verifier Proofs and Their Applications
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- 1-out-of-n Signatures from a Variety of Keys
- Foundations of Cryptography
- Advances in Cryptology - EUROCRYPT 2004
- Legally-Enforceable Fairness in Secure Two-Party Computation
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Legally Fair Contract Signing Without Keystones