On the untapped potential of encoding predicates by arithmetic circuits and their applications

DOI10.1007/978-3-319-70700-6_4zbMath1417.94066OpenAlexW2770537355MaRDI QIDQ1701437

Shuichi Katsumata

Publication date: 23 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70700-6_4

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

The price of verifiability: lower bounds for verifiable random functions ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Simulatable verifiable random function from the LWE assumption ⋮ 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 ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Verifiable random functions with optimal tightness

This page was built for publication: On the untapped potential of encoding predicates by arithmetic circuits and their applications