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
Composition and integrity preservation of secure reactive systems
Proceedings of the 7th ACM conference on Computer and communications security
Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals
CRYPTO '88 Proceedings of the 8th 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
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the International Conference on Cryptography: Policy and Algorithms
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
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
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th 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
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
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Oblivious transfer with access control: realizing disjunction without duplication
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Efficient computationally private information retrieval from anonymity or trapdoor groups
ISC'10 Proceedings of the 13th international conference on Information security
Access controls for oblivious and anonymous systems
ACM Transactions on Information and System Security (TISSEC)
Oblivious transfer with hidden access control policies
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Access Control for Databases: Concepts and Systems
Foundations and Trends in Databases
Practical adaptive oblivious transfer from simple assumptions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Electronic cash with anonymous user suspension
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Restricted adaptive oblivious transfer
Theoretical Computer Science
Oblivious transfer with complex attribute-based access control
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Practical PIR for electronic commerce
Proceedings of the 18th ACM conference on Computer and communications security
Efficient oblivious transfers with access control
Computers & Mathematics with Applications
Authenticating strangers in Online Social Networks
International Journal of Security and Networks
Unlinkable priced oblivious transfer with rechargeable wallets
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Optimistic fair priced oblivious transfer
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Oblivious outsourced storage with delegation
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
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
Computer Networks: The International Journal of Computer and Telecommunications Networking
Keeping identity secret in online social networks
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Oblivious transfer with hidden access control from attribute-based encryption
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Outsourced private information retrieval
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
Universally composable adaptive oblivious transfer (with access control) from standard assumptions
Proceedings of the 2013 ACM workshop on Digital identity management
| Hi-index | 0.00 |
We present a protocol for anonymous access to a database where the different records have different access control permissions. These permissions could be attributes, roles, or rights that the user needs to have in order to access the record. Our protocol offers maximal security guarantees for both the database and the user, namely (1) only authorized users can access the record; (2) the database provider does not learn which record the user accesses; and (3) the database provider does not learn which attributes or roles the user has when she accesses the database. We prove our protocol secure in the standard model (i.e., without random oracles) under the bilinear Diffie-Hellman exponent and the strong Diffie-Hellman assumptions.