Functional Encryption for Cascade Automata (Extended Abstract)
From MaRDI portal
Publication:5207903
DOI10.1007/978-3-319-21741-3_7zbMath1426.94087OpenAlexW2281918737MaRDI QIDQ5207903
Niv Gilboa, Shlomi Dolev, Dan Brownstein
Publication date: 14 January 2020
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-21741-3_7
Cites Work
- Unnamed Item
- Unnamed Item
- Functional encryption for cascade automata
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Attribute-Based Encryption for Circuits from Multilinear Maps
- Functional Encryption for Regular Languages
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- Modular Multiplication Without Trial Division
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Candidate Multilinear Maps from Ideal Lattices
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Attribute-based encryption for circuits
- Reusable garbled circuits and succinct functional encryption
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Functional Encryption for Cascade Automata (Extended Abstract)