SIAM Journal on Computing
Communication-efficient anonymous group identification
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Anonymous authentication with subset queries (extended abstract)
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
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
Anonymous Authentication of Membership in Dynamic Groups
FC '99 Proceedings of the Third International Conference on Financial Cryptography
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Collision-free accumulators and fail-stop signature schemes without trees
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
The Cramer-Shoup Strong-RSASignature Scheme Revisited
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
An efficient anonymous group identification scheme with human memorizable secret keys
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Provable bounds for portable and flexible privacy-preserving access
Proceedings of the tenth ACM symposium on Access control models and technologies
Succinct representation of flexible and privacy-preserving access rights
The VLDB Journal — The International Journal on Very Large Data Bases
Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05
Information Processing Letters
Threshold anonymous group identification and zero-knowledge proof
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Anonymous password-based authenticated key exchange
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
| Hi-index | 0.00 |
Two provably secure group identification schemes are presented in this report: 1) we extend De Santis, Crescenzo and Persiano's (SCP) anonymous group identification scheme to the discrete logarithm based case; then we provide a 3-move anonymous group identification scheme, which is more efficient than that presented in [SCPM, CDS], with the help of this basic scheme; 2) we also extend the original De Santis, Crescenzo and Persiano anonymous group identification scheme to the general case where each user holds public key which is chosen by herself independently. The communication cost for one round execution of the protocolis 2mk, where k is bit length of public key n and m is the number of users in the group.