Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
On using RSA with low exponent in a public key network
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Solving simultaneous modular equations of low degree
SIAM Journal on Computing - Special issue on cryptography
Communication-efficient anonymous group identification
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
CRYPTO '88 Proceedings of the 8th 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
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Unlinkable Serial Transactions
FC '97 Proceedings of the First International Conference on Financial Cryptography
Crowds: Anonymity for Web Transactions
Crowds: Anonymity for Web Transactions
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
Resource-Efficient Anonymous Group Identification
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Design and Security Analysis of Anonymous Group Identification Protocols
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Anonymous authentication with TLS and DAA
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Lightweight anonymous authentication with TLS and DAA for embedded mobile devices
ISC'10 Proceedings of the 13th international conference on Information security
Conditional privacy through ring signature in vehicular ad-hoc networks
Transactions on computational science XIII
Anonymous authentication from public-key encryption revisited
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Pseudonymous PKI for ubiquitous computing
EuroPKI 2006 Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice
A Privacy-Strengthened Scheme for E-Healthcare Monitoring System
Journal of Medical Systems
Authorization architectures for privacy-respecting surveillance
EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice
| Hi-index | 0.00 |
We present a series of protocols for authenticating an individual's membership in a group without revealing that individual's identity and without restricting how the membership of the group may be changed. In systems using these protocols a single message to the authenticator may be used by an individual to replace her lost key or by a trusted third party to add and remove members of the group. Applications in electronic commerce and communication can thus use these protocols to provide anonymous authentication while accommodating frequent changes in membership. We build these protocols on top of a new primitive: the verifiably common secret encoding. We show a construction for this primitive, the security of which is based on the existence of public-key cryptosystems capable of securely encoding multiple messages containing the same plaintext. Because the size of our construct grows linearly with the number of members in the group, we describe techniques for partitioning groups to improve performance.