Optimal Proximity Proofs Revisited
From MaRDI portal
Recommendations
- Optimal proximity proofs
- Probabilistically checkable proofs of proximity with zero-knowledge
- A hierarchy theorem for interactive proofs of proximity
- scientific article; zbMATH DE number 1304339
- Fast Reed-Solomon interactive oracle proofs of proximity
- Interactive proofs of proximity: delegating computation in sublinear time
- Optimal acceptors and optimal proof systems
- On the concrete efficiency of probabilistically-checkable proofs
- Zero-knowledge proofs of proximity
- Probabilistically checkable proofs and their consequences for approximation algorithms
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- scientific article; zbMATH DE number 503249 (Why is no real title available?)
- scientific article; zbMATH DE number 1394315 (Why is no real title available?)
- On modeling terrorist frauds. Addressing collusion in distance bounding protocols
- Optimal proximity proofs
- Probability Inequalities for Sums of Bounded Random Variables
- Secure and lightweight distance-bounding
- Towards secure distance bounding
Cited in
(7)- Formal analysis of distance bounding with secure hardware
- New attacks and secure design for anonymous distance-bounding
- Short paper: Terrorist fraud in distance bounding: getting around the models
- Efficient public-key distance bounding protocol
- Optimal proximity proofs
- scientific article; zbMATH DE number 1394315 (Why is no real title available?)
- A Symbolic Framework to Analyse Physical Proximity in Security Protocols
This page was built for publication: Optimal Proximity Proofs Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794513)
