Two-message witness indistinguishability and secure computation in the plain model from new assumptions
From MaRDI portal
Publication:1701448
DOI10.1007/978-3-319-70700-6_10zbMath1417.94040OpenAlexW2769708155MaRDI QIDQ1701448
Akshay Wadia, Saikrishna Badrinarayanan, Yuval Ishai, Sanjam Garg, Amit Sahai
Publication date: 23 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70700-6_10
Related Items
One-message zero knowledge and non-malleable commitments ⋮ Two-message statistically sender-private OT from LWE ⋮ Pattern matching on encrypted streams ⋮ Asymptotically quasi-optimal cryptography ⋮ Compressible FHE with applications to PIR ⋮ Algebraic restriction codes and their applications ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Concurrently composable non-interactive secure computation ⋮ Statistically sender-private OT from LPN and derandomization ⋮ A new framework for quantum oblivious transfer ⋮ Round-optimal black-box MPC in the plain model ⋮ A framework for statistically sender private OT with optimal rate ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Individual simulations ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Cryptographic group actions and applications ⋮ Secure quantum computation with classical communication ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness ⋮ Statistical ZAPs from group-based assumptions ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Blockchains enable non-interactive MPC ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Non-interactive secure computation from one-way functions ⋮ Offline witness encryption with semi-adaptive security ⋮ Statistical ZAP arguments ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ Succinct non-interactive secure computation ⋮ Two-round oblivious transfer from CDH or LPN
