Cryptography with Updates
From MaRDI portal
Publication:5738983
DOI10.1007/978-3-319-56614-6_15zbMath1415.94403OpenAlexW2612330673MaRDI QIDQ5738983
Aloni Cohen, Abhishek Jain, Prabhanjan V. Ananth
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_15
Related Items (4)
Constraining and Watermarking PRFs from Milder Assumptions ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ Simple and generic constructions of succinct functional encryption ⋮ Updatable signatures and message authentication codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Incremental program obfuscation
- Output-Compressing Randomized Encodings and Applications
- Indistinguishability Obfuscation with Non-trivial Efficiency
- How to Avoid Obfuscation Using Witness PRFs
- Functional Encryption Without Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Key Homomorphic PRFs and Their Applications
- Functional Encryption: New Perspectives and Lower Bounds
- On the Achievability of Simulation-Based Security for Functional Encryption
- Constrained Pseudorandom Functions and Their Applications
- Witness Encryption from Instance Independent Assumptions
- Malleable Proof Systems and Applications
- Incremental Deterministic Public-Key Encryption
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Functional Encryption: Definitions and Challenges
- Homomorphic Signatures for Polynomial Functions
- Incremental Unforgeable Encryption
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Predicate Encryption for Circuits from LWE
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Succinct Malleable NIZKs and an Application to Compact Shuffles
- How to Garble RAM Programs?
- Fully homomorphic encryption using ideal lattices
- How to use indistinguishability obfuscation
- Locally Decodable and Updatable Non-malleable Codes and Their Applications
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
- Fuzzy Identity-Based Encryption
- Functional Signatures and Pseudorandom Functions
- Garbled RAM Revisited
- Multi-input Functional Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Witness encryption and its applications
- Reusable garbled circuits and succinct functional encryption
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
- Locally Updatable and Locally Decodable Codes
- Cryptography in $NC^0$
This page was built for publication: Cryptography with Updates
