How to construct random functions
Journal of the ACM (JACM)
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
An Efficient Scheme for Proving a Shuffle
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
CRYPTO '02 Proceedings of the 22nd 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
Secure Voting Using Partially Compatible Homomorphisms
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Unlinkable Electronic Coupon Protocol with Anonymity Control
ISW '99 Proceedings of the Second International Workshop on Information Security
An Improvement on a Practical Secret Voting Scheme
ISW '99 Proceedings of the Second International Workshop on Information Security
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Efficient Off-line Electronic Cash System Based On The Representation Problem.
An Efficient Off-line Electronic Cash System Based On The Representation Problem.
Pseudorandom functions revisited: the cascade construction and its concrete security
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Proceedings of the 11th ACM conference on Computer and communications security
Discrete Applied Mathematics - Special issue: Coding and cryptography
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Transferred cash grows in size
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
An efficient group signature scheme from bilinear maps
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
A verifiable random function with short proofs and keys
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Dynamic k-times anonymous authentication
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Group signatures: better efficiency and new theoretical aspects
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Foundations of group signatures: the case of dynamic groups
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Group signatures with efficient concurrent join
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Blacklistable anonymous credentials: blocking misbehaving users without ttps
Proceedings of the 14th ACM conference on Computer and communications security
Efficient Protocols for Set Membership and Range Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Compact E-Cash and Simulatable VRFs Revisited
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
A Selectable k-Times Relaxed Anonymous Authentication Scheme
Information Security Applications
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
PPAA: peer-to-peer anonymous authentication
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
P-signatures and noninteractive anonymous credentials
TCC'08 Proceedings of the 5th conference on Theory of cryptography
BLAC: Revoking Repeatedly Misbehaving Anonymous Users without Relying on TTPs
ACM Transactions on Information and System Security (TISSEC)
On server trust in private proxy auctions
Electronic Commerce Research
Non-interactive distributed encryption: a new primitive for revocable privacy
Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
Efficient dynamic k-times anonymous authentication
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Constant-size ID-based linkable and revocable-iff-linked ring signature
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient oblivious transfers with access control
Computers & Mathematics with Applications
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Event-oriented k-times revocable-iff-linked group signatures
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Scalable group signatures with revocation
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
A new hash-and-sign approach and structure-preserving signatures from DLIN
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
A k-Times Anonymous Authentication (k-TAA) scheme allows users to be authenticated anonymously so long as the number of times that they are authenticated is within an allowable number. Some promising applications are e-voting, e-cash, e-coupons, and trial browsing of contents. However, the previous schemes are not efficient in the case where the allowable number k is large, since they require both users and verifiers to compute O(k) exponentiation in each authentication. We propose a k-TAA scheme where the numbers of exponentiations required for the entities in an authentication are independent of k. Moreover, we propose a notion of public detectability in a k-TAA scheme and present an efficient publicly verifiable k-TAA scheme, where the number of modular exponentiations required for the entities is O(log(k)).