Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
A secure and privacy-protecting protocol for transmitting personal information between organizations
Proceedings on Advances in cryptology---CRYPTO '86
One-way accumulators: a decentralized alternative to digital signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
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 Divisible Electronic Cash Scheme
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the International Conference on Cryptography: Policy and Algorithms
Proceedings of the 11th ACM conference on Computer and communications security
11th ACM Conference on Computer and Communications Security 2004
Proceedings of the 11th ACM conference on Computer and communications security
11th ACM Conference on Computer and Communications Security 2004
Proceedings of the 11th ACM conference on Computer and communications security
Group signatures with verifier-local revocation
Proceedings of the 11th ACM conference on Computer and communications security
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Universal Accumulators with Efficient Nonmembership Proofs
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Rapid demonstration of linear relations connected by boolean operators
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Full-domain subgroup hiding and constant-size group signatures
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Quasi-efficient revocation of group signatures
FC'02 Proceedings of the 6th international conference on Financial cryptography
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
A new dynamic accumulator for batch updates
ICICS'07 Proceedings of the 9th international conference on Information and communications security
P-signatures and noninteractive anonymous credentials
TCC'08 Proceedings of the 5th conference on Theory of cryptography
A cryptographic framework for the controlled release of certified data
SP'04 Proceedings of the 12th international conference on Security Protocols
Accumulators from bilinear pairings and applications
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Efficient blind and partially blind signatures without random oracles
TCC'06 Proceedings of the Third conference on Theory of Cryptography
An anonymous attestation scheme with optional traceability
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Structure-preserving signatures and commitments to group elements
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On the impossibility of batch update for cryptographic accumulators
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Solving revocation with efficient update of anonymous credentials
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Optimal authenticated data structures with multilinear forms
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Revocation for delegatable anonymous credentials
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Authenticated Dictionaries: Real-World Costs and Trade-Offs
ACM Transactions on Information and System Security (TISSEC)
Efficient proofs of attributes in pairing-based anonymous credential system
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
Analysis of revocation strategies for anonymous Idemix credentials
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Anonymous credentials from (indexed) aggregate signatures
Proceedings of the 7th ACM workshop on Digital identity management
Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Multiple denominations in e-cash with compact transaction data
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
On extended sanitizable signature schemes
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Efficient schemes for anonymous yet authorized and bounded use of cloud resources
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Short transitive signatures for directed trees
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Block-wise p-signatures and non-interactive anonymous credentials with efficient attributes
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Multi-show anonymous credentials with encrypted attributes in the standard model
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Group signature with constant revocation costs for signers and verifiers
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Security and Communication Networks
Scalable group signatures with revocation
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Secure accumulators from euclidean rings without trusted setup
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Size-hiding in private set intersection: existential results and constructions
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
A revocable group signature scheme with the property of hiding the number of revoked users
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Proceedings of the 2012 ACM conference on Computer and communications security
Divisible e-cash in the standard model
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Lightweight authentication of linear algebraic queries on data streams
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Protecting privacy by sanitizing personal data: a new approach to anonymous credentials
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Privacy-preserving billing for e-ticketing systems in public transportation
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Optimally private access control
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
PPREM: Privacy Preserving REvocation Mechanism for Vehicular Ad Hoc Networks
Computer Standards & Interfaces
Hi-index | 0.00 |
The success of electronic authentication systems, be it e-ID card systems or Internet authentication systems such as CardSpace, highly depends on the provided level of user-privacy. Thereby, an important requirement is an efficient means for revocation of the authentication credentials. In this paper we consider the problem of revocation for certificate-based privacy-protecting authentication systems. To date, the most efficient solutions for revocation for such systems are based on cryptographic accumulators. Here, an accumulate of all currently valid certificates is published regularly and each user holds a witness enabling her to prove the validity of her (anonymous) credential while retaining anonymity. Unfortunately, the users' witnesses must be updated at least each time a credential is revoked. For the know solutions, these updates are computationally very expensive for users and/or certificate issuers which is very problematic as revocation is a frequent event as practice shows. In this paper, we propose a new dynamic accumulator scheme based on bilinear maps and show how to apply it to the problem of revocation of anonymous credentials. In the resulting scheme, proving a credential's validity and updating witnesses both come at (virtually) no cost for credential owners and verifiers. In particular, updating a witness requires the issuer to do only one multiplication per addition or revocation of a credential and can also be delegated to untrusted entities from which a user could just retrieve the updated witness. We believe that thereby we provide the first authentication system offering privacy protection suitable for implementation with electronic tokens such as eID cards or drivers' licenses.