Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security

DOI10.1109/SFFCS.1999.814628MaRDI QIDQ7238321zbMATH OpenFDO

Authors A. Sahai

Publication date 6 May 2026

Full work available at URL https://doi.org/10.1109/SFFCS.1999.814628

Mathematics Subject Classification ID

Graph theory (05Cxx) Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68Rxx) Nonnumerical algorithms (68W05) Quantum computation (81P68)

Cited in

(6)

• Simultaneous-message and succinct secure computation: reusable and multiparty protocols
• Distributed monotone-policy encryption for DNFs from lattices
• Partial fraction techniques for cryptography
• Hierarchical identity-based encryption with receiver selective opening security in the multi-challenge setting
• On quantum simulation-soundness
• The art of linearization: from a KZG's trick to a general commitment framework

This page was built for publication: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security

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