Optimal proximity proofs
From MaRDI portal
Publication:3454584
Recommendations
Cites work
- scientific article; zbMATH DE number 1394315 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- On modeling terrorist frauds. Addressing collusion in distance bounding protocols
- On the pseudorandom function assumption in (secure) distance-bounding protocols. PRF-ness alone does not stop the frauds!
- Optimal proximity proofs
- Position Based Cryptography
- Probability Inequalities for Sums of Bounded Random Variables
- Secure and lightweight distance-bounding
- Sound proof of proximity of knowledge
- The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks
- Towards secure distance bounding
Cited in
(12)- Efficient public-key distance bounding protocol
- Formal analysis of distance bounding with secure hardware
- scientific article; zbMATH DE number 1394315 (Why is no real title available?)
- Optimal proximity proofs
- Sound proof of proximity of knowledge
- On the pseudorandom function assumption in (secure) distance-bounding protocols. PRF-ness alone does not stop the frauds!
- Secure and lightweight distance-bounding
- On modeling terrorist frauds. Addressing collusion in distance bounding protocols
- Optimal Proximity Proofs Revisited
- Towards secure distance bounding
- New attacks and secure design for anonymous distance-bounding
- Short paper: Terrorist fraud in distance bounding: getting around the models
This page was built for publication: Optimal proximity proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454584)