Threshold Cryptosystems Based on Factoring
- 8 November 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 192-205
- https://doi.org/10.1007/3-540-36178-2_12
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Security Proof for Partial-Domain Hash Signature SchemesLecture Notes in Computer Science, 2002
- Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime ProductsLecture Notes in Computer Science, 2002
- Threshold Cryptosystems Secure against Chosen-Ciphertext AttacksLecture Notes in Computer Science, 2001
- Fully Distributed Threshold RSA under Standard AssumptionsLecture Notes in Computer Science, 2001
- Cryptographic Counters and Applications to Electronic VotingLecture Notes in Computer Science, 2001
- Multiparty Computation from Threshold Homomorphic EncryptionLecture Notes in Computer Science, 2001
- Practical Threshold SignaturesLecture Notes in Computer Science, 2000
- Computing Inverses over a Shared Secret ModulusLecture Notes in Computer Science, 2000
- Robust and Efficient Sharing of RSA FunctionsJournal of Cryptology, 2000
- Joint Encryption and Message-Efficient Secure ComputationJournal of Cryptology, 1996