Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations
Authors:
- Guilhem CastagnosGCGuilhem Castagnos
- Dario CatalanoDCDario Catalano
- Fabien LaguillaumieFLFabien Laguillaumie
- Federico SavastaFSFederico Savasta
- Ida TuckerITIda Tucker
- 1 August 2019
- book chapter
- Published by Springer Nature
- p. 191-221
Abstract
No abstract availableThis publication has 35 references indexed in Scilit:
- Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p2018
- Verifiable Delay Functions2018
- Encryption Switching Protocols Revisited: Switching Modulo p2017
- Linearly Homomorphic Encryption from $\mathsf {DDH}$2015
- Security Estimates for Quadratic Field Based CryptosystemsLecture Notes in Computer Science, 2010
- On the Portability of Generalized Schnorr Proofs2009
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest CryptanalysisLecture Notes in Computer Science, 2009
- On Class Group Computations Using the Number Field SieveLecture Notes in Computer Science, 2003
- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption2002
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack1998