This paper studies how to take advantage of other's computing ability to sign a message with one's private key without disclosing the private key.A protocol to this problem is presented, and it is proven, by well known simulation paradigm, that this protocol is private.
Quantum digital signatures (QDSs), generating correlated bit strings among three remote parties for signatures through quantum law, can guarantee nonrepudiation, authenticity, and integrity of messages. Recently, a one-time universal-hashing QDS framework, exploiting the quantum asymmetric encryption and universal hash functions, has been proposed to significantly improve the signature rate and ensure unconditional security by directly signing the hash value of long messages. However, similar to quantum key distribution, this framework utilizes keys with perfect secrecy by performing privacy amplification that introduces cumbersome matrix operations, thereby consuming large computational resources, causing delays, and increasing failure probability. Here, we prove that, different from private communication, imperfect quantum keys with partial information leakage can be used for digital signatures and authentication without compromising the security while having eight orders of magnitude improvement on signature rate for signing a megabit message compared with conventional single-bit schemes. This study significantly reduces the delay for data postprocessing and is compatible with any quantum key generation protocols. In our simulation, taking two-photon twin-field key generation protocol as an example, QDS can be practically implemented over a fiber distance of 650 km between the signer and receiver. For the first time, this study offers a cryptographic application of quantum keys with imperfect secrecy and paves a way for the practical and agile implementation of digital signatures in a future quantum network.
In a multiparty signing protocol, also known as a threshold signature scheme, the private signing key is shared amongst a set of parties and only a quorum of those parties can generate a signature. Research on multiparty signing has been growing in popularity recently due to its application to cryptocurrencies. Most work has focused on reducing the number of rounds to two, and as a result: (a) are not fully simulatable in the sense of MPC real/ideal security definitions, and/or (b) are not secure under concurrent composition, and/or (c) utilize non-standard assumptions of different types in their proofs of security. In this paper, we describe a simple three-round multiparty protocol for Schnorr signatures that is secure for any number of corrupted parties; i.e., in the setting of a dishonest majority. The protocol is fully simulatable, secure under concurrent composition, and proven secure in the standard model or random-oracle model (depending on the instantiations of the commitment and zero-knowledge primitives). The protocol realizes an ideal Schnorr signing functionality with perfect security in the ideal commitment and zero-knowledge hybrid model (and thus the only assumptions needed are for realizing these functionalities). In our presentation, we do not assume that all parties begin with the message to be signed, the identities of the participating parties and a unique common session identifier, since this is often not the case in practice. Rather, the parties achieve consensus on these parameters as the protocol progresses.
This chapter discusses zero-knowledge proofs of identity, blind signatures, identity-based public-key cryptography, oblivious transfer and signatures, simultaneous contract signing, digital certified mail, and simultaneous exchange of secrets. Using a zero-knowledge proof, a person can prove that he knows his private key and therefore proves his identity. An essential feature of digital signature protocols is that the signer knows what he is signing. Identity-based cryptosystems, sometimes called Non-Interactive Key Sharing (NIKS) systems, help the sender send a secure message to another person, without wanting to get his public key from a key server. No one really cares about being able to do oblivious transfer in practice, but the notion is an important building block for other protocols. Simultaneous contract signing takes place in a situation where two parties who have entered into an agreement, agree on the wording, but neither wishes to sign unless the other signs as well.