Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
The Schnorr blind signing protocol allows blind issuing of Schnorr signatures, one of the
most widely used signatures. Despite its practical relevance, its security analysis is …
most widely used signatures. Despite its practical relevance, its security analysis is …
On the security of two-round multi-signatures
A multi-signature scheme allows a group of signers to collaboratively sign a message,
creating a single signature that convinces a verifier that every individual signer approved the …
creating a single signature that convinces a verifier that every individual signer approved the …
Snowblind: A threshold blind signature in pairing-free groups
Both threshold and blind signatures have, individually, received a considerable amount of
attention. However little is known about their combination, ie, a threshold signature which is …
attention. However little is known about their combination, ie, a threshold signature which is …
Anonymous credentials light
We define and propose an efficient and provably secure construction of blind signatures with
attributes. Prior notions of blind signatures did not yield themselves to the construction of …
attributes. Prior notions of blind signatures did not yield themselves to the construction of …
A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
Blind signatures, proposed by Chaum (CRYPTO'82), are interactive protocols between a
signer and a user, where a user can obtain a signature without revealing the message to be …
signer and a user, where a user can obtain a signature without revealing the message to be …
Lattice-based blind signatures, revisited
We observe that all previously known lattice-based blind signature schemes contain subtle
flaws in their security proofs (eg, Rückert, ASIACRYPT'08) or can be attacked (eg, BLAZE by …
flaws in their security proofs (eg, Rückert, ASIACRYPT'08) or can be attacked (eg, BLAZE by …
On the impossibility of tight cryptographic reductions
The existence of tight reductions in cryptographic security proofs is an important question,
motivated by the theoretical search for cryptosystems whose security guarantees are truly …
motivated by the theoretical search for cryptosystems whose security guarantees are truly …
On pairing-free blind signature schemes in the algebraic group model
Studying the security and efficiency of blind signatures is an important goal for privacy
sensitive applications. In particular, for large-scale settings (eg, cryptocurrency tumblers), it …
sensitive applications. In particular, for large-scale settings (eg, cryptocurrency tumblers), it …
A modular treatment of blind signatures from identification schemes
We propose a modular security treatment of blind signatures derived from linear
identification schemes in the random oracle model. To this end, we present a general …
identification schemes in the random oracle model. To this end, we present a general …
Practical round-optimal blind signatures in the standard model
Round-optimal blind signatures are notoriously hard to construct in the standard model,
especially in the malicious-signer model, where blindness must hold under adversarially …
especially in the malicious-signer model, where blindness must hold under adversarially …