On the untapped potential of encoding predicates by arithmetic circuits and their applications
From MaRDI portal
Publication:1701437
DOI10.1007/978-3-319-70700-6_4zbMATH Open1417.94066OpenAlexW2770537355MaRDI QIDQ1701437FDOQ1701437
Authors: Shuichi Katsumata 
Publication date: 23 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70700-6_4
Recommendations
- Predicate encryption for circuits from LWE
- Generic transformations of predicate encodings: constructions and applications
- Arithmetic garbling from bilinear maps
- Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Cited In (10)
- The price of verifiability: lower bounds for verifiable random functions
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
- Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
- On the inner product predicate and a generalization of matching vector families
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Identity-based encryption from LWE with more compact master public key
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Verifiable random functions with optimal tightness
- Simulatable verifiable random function from the LWE assumption
This page was built for publication: On the untapped potential of encoding predicates by arithmetic circuits and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701437)
