Cryptography with updates
From MaRDI portal
Recommendations
Cites work
- A punctured programming approach to adaptively secure functional encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constrained pseudorandom functions and their applications
- Cryptography in NC^0
- From cryptomania to obfustopia through secret-key functional encryption
- Fully homomorphic encryption using ideal lattices
- Functional encryption without obfuscation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Functional signatures and pseudorandom functions
- Fuzzy Identity-Based Encryption
- Garbled RAM revisited
- Homomorphic signatures for polynomial functions
- How to avoid obfuscation using witness PRFs
- How to garble RAM programs?
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1263180 (Why is no real title available?)
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- scientific article; zbMATH DE number 1559561 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1406782 (Why is no real title available?)
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Incremental Deterministic Public-Key Encryption
- Incremental program obfuscation
- Incremental Unforgeable Encryption
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation with non-trivial efficiency
- Key homomorphic PRFs and their applications
- Leveled fully homomorphic signatures from standard lattices
- Locally decodable and updatable non-malleable codes and their applications
- Locally updatable and locally decodable codes
- Malleable proof systems and applications
- Multi-input functional encryption
- On the achievability of simulation-based security for functional encryption
- Output-compressing randomized encodings and applications
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Predicate encryption for circuits from LWE
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Reusable garbled circuits and succinct functional encryption
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct malleable NIZKs and an application to compact shuffles
- Succinct randomized encodings and their applications
- Witness encryption and its applications
- Witness encryption from instance independent assumptions
Cited in
(12)- Updatable signatures and message authentication codes
- Fully homomorphic NIZK and NIWI proofs
- Update semantics of security protocols
- Updatable public key encryption in the standard model
- Reconfigurable cryptography: a flexible approach to long-term security
- Public-Key Encryption with Efficient Amortized Updates
- Constraining and watermarking PRFs from milder assumptions
- Simple and generic constructions of succinct functional encryption
- Agile cryptography: a universally composable approach
- Updatable policy-compliant signatures
- Malleable SNARKs and their applications
- Homomorphic indistinguishability obfuscation and its applications
This page was built for publication: Cryptography with updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738983)
