Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Communications of the ACM
Security of Blind Discrete Log Signatures against Interactive Attacks
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Threshold Ring Signatures and Applications to Ad-hoc Groups
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
1-out-of-n Signatures from a Variety of Keys
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Some Recent Research Aspects of Threshold Cryptography
ISW '97 Proceedings of the First International Workshop on Information Security
A new paradigm for collision-free hashing: incrementality at reduced cost
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
An efficient and provable secure identity-based ring signcryption scheme
Computer Standards & Interfaces
A provably secure ring signature scheme in certificateless cryptography
ProvSec'07 Proceedings of the 1st international conference on Provable security
An efficient blind ring signature scheme without pairings
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Blind ring signatures secure under the chosen-target-CDH assumption
ISC'06 Proceedings of the 9th international conference on Information Security
Identity based ring signature: why, how and what next
EuroPKI'05 Proceedings of the Second European conference on Public Key Infrastructure
Identity based threshold ring signature
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Ring signature with designated linkability
IWSEC'06 Proceedings of the 1st international conference on Security
An efficient static blind ring signature scheme
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
Spontaneous anonymous group (SAG) cryptography is a fundamental alternative to achieve thresholding without group secret or setup. It has gained wide interests in applications to ad hoc groups. We present a general construction of blind SAG 1-out-of-n and t-out-of-n signature schemes from essentially any major blind signature. In the case when our scheme is built from blind Schnorr (resp. Okamoto-Schnorr) signature, the parallel one-more unforgeability is reduced to Schnorr’s ROS Problem in the random oracle model plus the generic group model. In the process of our derivations, we obtain a generalization of Schnorr’s result [17] from single public key to multiple public keys.