Direct computation of branching programs and its applications to more efficient lattice-based cryptography
From MaRDI portal
Publication:2698337
DOI10.1007/S10623-022-01104-5OpenAlexW4297492868WikidataQ114849656 ScholiaQ114849656MaRDI QIDQ2698337FDOQ2698337
Authors: Shuichi Katsumata, Toi Tomita, Shota Yamada 
Publication date: 21 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01104-5
Recommendations
Cites Work
- Fully homomorphic encryption with polylog overhead
- Better bootstrapping in fully homomorphic encryption
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- On lattices, learning with errors, random linear codes, and cryptography
- Functional encryption for inner product predicates from learning with errors
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Title not available (Why is that?)
- Efficient Identity-Based Encryption Without Random Oracles
- Fuzzy Identity-Based Encryption
- Classical hardness of learning with errors
- (Leveled) fully homomorphic encryption without bootstrapping
- Leveled fully homomorphic signatures from standard lattices
- A Framework for Efficient and Composable Oblivious Transfer
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Smallest singular value of random matrices and geometry of random polytopes
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Attribute-based encryption for circuits
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Advances in Cryptology - EUROCRYPT 2004
- Log Depth Circuits for Division and Related Problems
- Functional encryption for inner product: achieving constant-size ciphertexts with adaptive security or support for negation
- Pseudorandom functions and lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- Towards tightly secure lattice short signature and id-based encryption
- All-but-many lossy trapdoor functions from lattices and applications
- Functional encryption for threshold functions (or fuzzy IBE) from lattices
- Adaptively secure distributed PRFs from LWE
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Anonymous IBE, leakage resilience and circular security from new assumptions
- New and improved key-homomorphic pseudorandom functions
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
- Hardness of SIS and LWE with small parameters
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Faster Bootstrapping with Polynomial Error
- Predicate encryption for circuits from LWE
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Lattice-based FHE as secure as PKE
- Practical bootstrapping in quasilinear time
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- Group signatures without NIZK: from lattices in the standard model
- Riding on asymmetry: efficient ABE for branching programs
- Multi-theorem preprocessing NIZKs from lattices
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- Tightly-Secure Signatures from Chameleon Hash Functions
- Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR
This page was built for publication: Direct computation of branching programs and its applications to more efficient lattice-based cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698337)
