Practical Threshold Signatures

By Victor Shoup. International Conference on the Theory and Application of Cryptographic Techniques, 2000

1,053 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/d728243147560dd11960bc30f80a14fe6533a508

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Information Systems

Citations in the corpus

A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System (2001, methodology): “In [ 10 ], Shoup proposes an efficient threshold variant of RSA signatures.”
Uncheatable Reputation for Distributed Computation Markets (2006, methodology): “This is not generating a high overhead, requiring only the computation of a polynomial and an exponentiation [25].”
All You Need is DAG (2021, methodology): “One way to implement a global perfect coin is by using PKI and a threshold signature scheme [8, 33, 42] with a threshold of (f + 1)-of-n.”
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography (2000, methodology): “One could easily implement such a coin from the non-interactive threshold signature scheme of Shoup [46]; however, we present a dual-threshold coin-tossing scheme in the random oracle model that is based on the Diffie–Hellman problem, the analysis of which may be interesting in its own right.”
Multiparty Computation from Threshold Homomorphic Encryption (2000, methodology): “interactively and eciently by a standard equality of discrete log proof appearing in [ 17 ].”
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (2012, methodology): “Prior to this work, solutions for distributed discrete log-based key generation systems [38], and threshold encryption/decryption for RSA [39,62], DSS [37] and Paillier [6,23,34] in the multiparty setting, have been presented.”
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody (2018, background): “In the late 1980s and the 1990s, a large body of research emerged around the problem of threshold cryptography ; cf. [3, 9, 11, 12, 17, 34, 33, 29].”
Secure and Efficient Asynchronous Broadcast Protocols (2001, methodology): “Apart from ordinary digital signature schemes, we use collision-free hashing, pseudo-random generators, robust non-interactive dual-threshold signatures [18], threshold public-key encryption schemes [19], and a threshold pseudo-random function [13,6].”
Sharing Decryption in the Context of Voting or Lotteries (2000, methodology): “In this section, we recall previous works about threshold RSA and describe Shoup's threshold RSA signature scheme 21] that can also be viewed as a threshold RSA decryption algorithm.”
Pond: The OceanStore Prototype (2003, methodology): “Lastly, our current signature scheme is a threshold version of RSA developed by Shoup [32].”
Efficient generation of shared RSA keys (2001, background): “, where both (p− 1)/2 and (q− 1)/2 are prime) has been considered for security purposes [Gordon 1985] as well as for technical reasons related to threshold cryptography [Desmedt and Frankel 1992; Gennaro et al. 1996; Shoup 2000].”
Secure and efficient key management in mobile ad hoc networks (2005, methodology): “Some other secret sharing algorithms like share updating, and partial certificate are implemented in SEKM with proper modification and are given in Section 4 [7][13][14][15].”
MOCA : MObile Certificate Authority for Wireless Ad Hoc Networks (2004, background): “Any partial signatures beyond the required k are discarded and waste networking and processing resources.”
SBFT: A Scalable and Decentralized Trust Infrastructure (2018, methodology): “Creating and combining RSA signature shares via interpolation “in the exponent” requires several expensive operations [73].”
Providing robust and ubiquitous security support for mobile ad-hoc networks (2001, background): “The concepts of threshold secret sharing [14] [2] [4] [12] [15] and secret share updates [7] [5] are not new, and have been studied in the cryptography context.”
HotStuff: BFT Consensus with Linearity and Responsiveness (2019, neutral): “HotStuffmakes use of threshold signatures [14, 18, 48].”
Sequential Aggregate Signatures from Trapdoor Permutations (2004, background): “Also of interest are threshold signatures, in particular the non-interactive threshold signature scheme due to Shoup [18], where we have a set of n signers, and a threshold t, such that signature shares from any t < k ≤ n signers can be combined into one signature.”