A Randomized Algorithm for BBCSPs in the Prover-Verifier Model

DOI10.1007/978-3-540-75292-9_31zbMATH Open1147.68538OpenAlexW1482123590MaRDI QIDQ3525105

K. Subramani

Publication date: 17 September 2008

Published in: Theoretical Aspects of Computing – ICTAC 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75292-9_31

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Related Items (1)

Verifiable Obtained Random Subsets for Improving SPHINCS+

Recommendations

• Proofs of randomized algorithms in Coq 👍 👎
• Probabilistically checkable proofs and their consequences for approximation algorithms 👍 👎
• Randomized proof-labeling schemes 👍 👎
• Constant-space, constant-randomness verifiers with arbitrarily small error 👍 👎
• Modular verification of protocol equivalence in the presence of randomness 👍 👎
• Towards mechanized correctness proofs for cryptographic algorithms: axiomatization of a probabilistic Hoare style logic 👍 👎
• Randomized proof-labeling schemes 👍 👎
• Proofs of Randomized Algorithms in Coq 👍 👎
• Underapproximation for Model-Checking Based on Random Cryptographic Constructions 👍 👎
• On the concrete efficiency of probabilistically-checkable proofs 👍 👎

This page was built for publication: A Randomized Algorithm for BBCSPs in the Prover-Verifier Model

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