On Input Indistinguishable Proof Systems

DOI10.1007/978-3-662-43948-7_74MaRDI QIDQ5167801zbMATH OpenOpenAlexFDO

Authors Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti

Publication date 1 July 2014

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43948-7_74

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Input-oblivious proof systems and a uniform complexity perspective on P/poly
• Inductive Proofs of Computational Secrecy
• On doubly-efficient interactive proof systems
• Indistinguishable proofs of work or knowledge
• Impossibility results for static input secure computation
• Interactive Proofs with Provable Security against Honest Verifiers
• scientific article; zbMATH DE number 512981
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• A note on computational indistinguishability

Cited in

(2)

• An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
• On constant-round concurrent non-malleable proof systems

This page was built for publication: On Input Indistinguishable Proof Systems

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