Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Protecting data privacy in private information retrieval schemes
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Oblivious Transfer with Adaptive Queries
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Priced Oblivious Transfer: How to Sell Digital Goods
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Attribute-based encryption for fine-grained access control of encrypted data
Proceedings of the 13th ACM conference on Computer and communications security
Ciphertext-Policy Attribute-Based Encryption
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
SIAM Journal on Computing
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Delegating Capabilities in Predicate Encryption Systems
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Bounded Ciphertext Policy Attribute Based Encryption
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Predicate Privacy in Encryption Systems
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Conjunctive, subset, and range queries on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Reducing trust in the PKG in identity based cryptosystems
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Predicate encryption supporting disjunctions, polynomial equations, and inner products
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Fuzzy identity-based encryption
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
How to delegate and verify in public: verifiable computation from attribute-based encryption
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Hiding the policy in cryptographic access control
STM'11 Proceedings of the 7th international conference on Security and Trust Management
Functional encryption: a new vision for public-key cryptography
Communications of the ACM
Foundations of garbled circuits
Proceedings of the 2012 ACM conference on Computer and communications security
Attribute-based encryption for circuits
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Reusable garbled circuits and succinct functional encryption
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.02 |
In this work, we put forward the notion of Worry-Free Encryption. This allows Alice to encrypt confidential information under Bob's public key and send it to him, without having to worry about whether Bob has the authority to actually access this information. This is done by encrypting the message under a hidden access policy that only allows Bob to decrypt if his credentials satisfy the policy. Our notion can be seen as a functional encryption scheme but in a public-key setting. As such, we are able to insist that even if the credential authority is corrupted, it should not be able to compromise the security of any honest user. We put forward the notion of Worry-Free Encryption and show how to achieve it for any polynomial-time computable policy, under only the assumption that IND-CPA public-key encryption schemes exist. Furthermore, we construct CCA-secure Worry-Free Encryption, efficiently in the random oracle model, and generally (but inefficiently) using simulation-sound non-interactive zero-knowledge proofs.