Cryptography with Updates (Q5738983)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6729791

Language	Label	Description	Also known as
English	Cryptography with Updates	scientific article; zbMATH DE number 6729791

Statements

scholarly article

0 references

Cryptography with Updates (English)

0 references

0 references

0 references

Prabhanjan V. Ananth

0 references

Lecture Notes in Computer Science

0 references

publication date

13 June 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-56614-6_15

0 references

Functional Encryption: New Perspectives and Lower Bounds

0 references

Indistinguishability Obfuscation from Compact Functional Encryption

0 references

Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption

0 references

Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software

0 references

Cryptography in $NC^0$

0 references

Improved proxy re-encryption schemes with applications to secure distributed storage

0 references

0 references

0 references

0 references

Succinct Randomized Encodings and their Applications

0 references

From Cryptomania to Obfustopia Through Secret-Key Functional Encryption

0 references

0 references

Homomorphic Signatures for Polynomial Functions

0 references

Key Homomorphic PRFs and Their Applications

0 references

Functional Encryption: Definitions and Challenges

0 references

Conjunctive, Subset, and Range Queries on Encrypted Data

0 references

Constrained Pseudorandom Functions and Their Applications

0 references

Functional Signatures and Pseudorandom Functions

0 references

Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions

0 references

Incremental Unforgeable Encryption

0 references

Succinct Garbling and Indistinguishability Obfuscation for RAM Programs

0 references

On the Achievability of Simulation-Based Security for Functional Encryption

0 references

Locally Updatable and Locally Decodable Codes

0 references

Malleable Proof Systems and Applications

0 references

Succinct Malleable NIZKs and an Application to Compact Shuffles

0 references

Locally Decodable and Updatable Non-malleable Codes and Their Applications

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Functional Encryption Without Obfuscation

0 references

Witness encryption and its applications

0 references

Incremental program obfuscation

0 references

Fully homomorphic encryption using ideal lattices

0 references

Garbled RAM Revisited

0 references

Witness Encryption from Instance Independent Assumptions

0 references

0 references

Multi-input Functional Encryption

0 references

Reusable garbled circuits and succinct functional encryption

0 references

Predicate Encryption for Circuits from LWE

0 references

Leveled Fully Homomorphic Signatures from Standard Lattices

0 references

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

0 references

Indistinguishability Obfuscation with Non-trivial Efficiency

0 references

Output-Compressing Randomized Encodings and Applications

0 references

How to Garble RAM Programs?

0 references

0 references

Incremental Deterministic Public-Key Encryption

0 references

Fuzzy Identity-Based Encryption

0 references

How to use indistinguishability obfuscation

0 references

A Punctured Programming Approach to Adaptively Secure Functional Encryption

0 references

How to Avoid Obfuscation Using Witness PRFs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-56614-6_15

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5738983

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5738983&oldid=36327119"