Simultaneous-message and succinct secure computation: reusable and multiparty protocols

Cites work

(Leveled) fully homomorphic encryption without bootstrapping
A unified framework for succinct garbling from homomorphic secret sharing
Attribute-based encryption for circuits of unbounded depth from lattices
Black-box non-interactive zero knowledge from vector trapdoor hash
Candidate indistinguishability obfuscation and functional encryption for all circuits
Enhanced trapdoor hashing from DDH and DCR
Fully homomorphic encryption using ideal lattices
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
Homomorphic secret sharing from lattices without FHE
scientific article; zbMATH DE number 1842511 (Why is no real title available?)
Laconic function evaluation and applications
Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
Mr NISC: multiparty reusable non-interactive secure computation
Multiparty reusable non-interactive secure computation from LWE
NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
On lattices, learning with errors, random linear codes, and cryptography
Private constrained PRFs (and more) from LWE
Replication is not needed: single database, computationally-private information retrieval
Secure computation on the web: computing without simultaneous interaction
Simultaneous-message and succinct secure computation
The random oracle methodology, revisited.
Trapdoor hash functions and their applications
Unbounded multi-party computation from learning with errors

This page was built for publication: Simultaneous-message and succinct secure computation: reusable and multiparty protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299815)