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_4zbMath1417.94066OpenAlexW2770537355MaRDI QIDQ1701437
Publication date: 23 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70700-6_4
Related Items
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
