搜索结果: 1-15 共查到“军事学 blind signatures”相关记录24条 . 查询时间(0.078 秒)
A Modular Treatment of Blind Signatures from Identification Schemes
Blind signature identification schemes Forking Lemma
2019/3/6
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 framework that captures several wel...
Conditional Blind Signatures
digital signatures blind signatures designated verifier signatures
2017/7/19
We propose a novel cryptographic primitive that we call conditional blind signatures. Our primitive allows a user to request blind signatures on messages of her choice. The signer has a secret Boolean...
Efficient Round-Optimal Blind Signatures in the Standard Model
Blind Signatures Round-Optimal Partial Blindness
2017/2/20
Blind signatures are at the core of e-cash systems and has numerous other applications. In this work we construct efficient blind and partially blind signature schemes over bilinear groups in the stan...
Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
Blind Signatures Standard Model SPS-EQ
2016/6/29
At Crypto’15 Fuchsbauer, Hanser and Slamanig (FHS) presented the first standardmodel
construction of efficient round-optimal blind signatures that does not require complexity
leveraging. It is conce...
Known constructions of blind signature schemes suffer from at least one of the following
limitations: (1) rely on parties having access to a common reference string or a random oracle,
(2) are not r...
Practical Round-Optimal Blind Signatures in the Standard Model
Standard Model SPS-EQ One-Show Anonymous Credentials
2015/12/29
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 chosen keys. This is s...
Formalizing Group Blind Signatures and Practical Constructions without Random Oracles
public-key cryptography/ Group Signatures Blind Signatures Group Blind Signatures Security Model
2012/3/27
In this paper, we first provide foundations for dynamic group blind signatures where we provide formal security definitions and present a security model to capture all the security properties. In doin...
Security of Blind Signatures Revisited
public-key cryptography blind signatures definitions
2011/7/25
We revisit the definition of unforgeability of blind signatures as proposed by Pointcheval and Stern (Journal of Cryptology 2000).
Security of Blind Signatures Revisited
public-key cryptography / blind signatures definitions
2012/3/27
We revisit the definition of unforgeability of blind signatures as proposed by Pointcheval and Stern (Journal of Cryptology 2000). Surprisingly, we show that this established definition falls short in...
Round Optimal Blind Signatures
round optimal blind
2012/3/28
All known round optimal (i.e., two-move) blind signature schemes either need a common reference string, rely on random oracles, or assume the hardness of some interactive assumption. At Eurocrypt 2010...
Round Optimal Blind Signatures
common reference string interactive assumption three-move blind signature
2011/6/9
All known round optimal (i.e., two-move) blind signature schemes either need a common reference string, rely on random oracles, or assume the hardness of some interactive assumption. At Eurocrypt 2010...
Efficient Two-Move Blind Signatures in the Common Reference String Model
Two-Move Blind Signatures the Common Reference String Model
2010/11/10
Blind signatures provide a mechanism for achieving privacy and anonymity whereby a user gets the signer to sign a message of his choice without the signer learning the content of the message, nor link...
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
blind signatures pairings composite-order groups
2010/9/9
In this paper, we show that there are limits to such transformations. Specifically, we show that Freeman's properties, cancelling and projecting, cannot simultaneously be obtained using prime-order gr...
A fair blind signature is a blind signature with revocable
anonymity and unlinkability, i.e., an authority can link an issuing session
to the resulting signature and trace a signature to the user wh...
A Framework for Universally Composable Non-Committing Blind Signatures
Blind Signatures Non-committing Blind Signatures Universal Composability
2009/11/18
A universally composable (UC) blind signature functionality requres users to commit to
the message to be blindly signed. It is thereby impossible to realize in the plain model.
This paper shows that...