Instance-hiding interactive proofs

DOI10.1007/S00145-026-09573-WMaRDI QIDQ7227359zbMATH OpenFDO

Authors Changrui Mu, Prashant Nalini Vasudevan

Publication date 10 April 2026

Published in Journal of Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00145-026-09573-W

zbMATH Keywords

instance-hidinginteractive proofs

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Algebraic methods for interactive proof systems
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Collision-resistance from multi-collision-resistance
• Cryptography in constant parallel time
• Efficient signature generation by smart cards
• From secrecy to soundness: efficient verification via secure computation (extended abstract)
• scientific article; zbMATH DE number 1808277 (Why is no real title available?)
• scientific article; zbMATH DE number 4213418 (Why is no real title available?)
• scientific article; zbMATH DE number 503260 (Why is no real title available?)
• scientific article; zbMATH DE number 697825 (Why is no real title available?)
• scientific article; zbMATH DE number 4185024 (Why is no real title available?)
• IP = PSPACE
• On distributional collision resistant hashing
• On hiding information from an oracle
• On Monotone Formula Composition of Perfect Zero-Knowledge Languages
• On relationships between statistical zero-knowledge proofs
• On the Composition of Zero-Knowledge Proof Systems
• On the relationship between statistical zero-knowledge and statistical randomized encodings
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• Some consequences of non-uniform conditions on uniform classes
• Statistical randomized encodings: a complexity theoretic view
• Statistical zero-knowledge languages can be recognized in two rounds
• The Discrete Logarithm problem with preprocessing
• The knowledge complexity of interactive proof-systems
• The special functions and their approximations. Vol. I, II
• Verifying and decoding in constant depth

This page was built for publication: Instance-hiding interactive proofs

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