Weak zero-knowledge via the Goldreich-Levin theorem

DOI10.1007/978-981-99-8724-5_5MaRDI QIDQ6562563zbMATH OpenFDO

Authors Dakshita Khurana, Giulio Malavolta, Kabir Tomer

Publication date 26 June 2024

Full work available at URL https://doi.org/10.1007/978-981-99-8724-5_5

zbMATH Keywords

distinguisherGoldreich-Levinsimulationzero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Weak Zero-Knowledge beyond the Black-Box Barrier
• Weak zero-knowledge beyond the black-box barrier
• From weak to strong zero-knowledge and applications
• Towards malicious security of private coin honest verifier zero knowledge for NP via witness encryption
• scientific article; zbMATH DE number 1302862

Cites work

• Distinguisher-dependent simulation in two rounds and its applications
• Efficient oblivious transfer protocols
• Enhancements of trapdoor permutations
• Foundations of Cryptography
• Foundations of Cryptography
• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• Individual simulations
• Magic functions
• Round optimal concurrent non-malleability from polynomial hardness
• Smooth projective hashing and two-message oblivious transfer
• Statistical witness indistinguishability (and more) in two messages
• Two-message statistically sender-private OT from LWE
• Two-round oblivious transfer from CDH or LPN
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Zaps and Their Applications

Cited in

(1)

• Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash

This page was built for publication: Weak zero-knowledge via the Goldreich-Levin theorem

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