Distinguisher-dependent simulation in two rounds and its applications

From MaRDI portal
Publication:1678369

DOI10.1007/978-3-319-63715-0_6zbMath1409.94880OpenAlexW2611973433MaRDI QIDQ1678369

Dakshita Khurana, Yael Tauman Kalai, Abhishek Jain, Ron D. Rothblum

Publication date: 15 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63715-0_6




Related Items (23)

A black-box approach to post-quantum zero-knowledge in constant roundsThree-round secure multiparty computation from black-box two-round oblivious transferTwo-message statistically sender-private OT from LWEKnowledge encryption and its applications to simulatable protocols with low round-complexityPublic-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hashTwo-round adaptively secure MPC from isogenies, LPN, or CDHStatistically sender-private OT from LPN and derandomizationA new framework for quantum oblivious transferA framework for statistically sender private OT with optimal rateIndividual simulationsSimpler statistically sender private oblivious transfer from ideals of cyclotomic integersCryptographic group actions and applicationsThe round complexity of quantum zero-knowledgeBlack-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardnessStatistical ZAPs from group-based assumptionsTwo-round maliciously secure computation with super-polynomial simulationStatistical ZAP argumentsStatistical Zaps and new oblivious transfer protocolsWitness indistinguishability for any single-round argument with applications to access controlNon-interactive distributional indistinguishability (NIDI) and non-malleable commitmentsNew techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trustWeak Zero-Knowledge beyond the Black-Box BarrierTwo-round oblivious transfer from CDH or LPN




This page was built for publication: Distinguisher-dependent simulation in two rounds and its applications