Optimal proximity proofs

DOI10.1007/978-3-319-16745-9_10zbMATH Open1400.94125OpenAlexW1558754461MaRDI QIDQ3454584FDOQ3454584

Authors: Ioana Boureanu, Serge Vaudenay 

Publication date: 25 November 2015

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-16745-9_10

Recommendations

• Optimal Proximity Proofs Revisited
• On modeling terrorist frauds. Addressing collusion in distance bounding protocols
• Security Analysis of Two Distance-Bounding Protocols
• Secure and lightweight distance-bounding
• Towards secure distance bounding

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Title not available (Why is that?)
• Position Based Cryptography
• The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks
• Optimal Proximity Proofs
• Sound Proof of Proximity of Knowledge
• Secure and Lightweight Distance-Bounding
• On Modeling Terrorist Frauds
• Towards Secure Distance Bounding
• On the pseudorandom function assumption in (secure) distance-bounding protocols. PRF-ness alone does not stop the frauds!

Cited In (6)

• Short paper: Terrorist fraud in distance bounding: getting around the models
• Efficient Public-Key Distance Bounding Protocol
• Optimal Proximity Proofs Revisited
• Optimal Proximity Proofs
• Title not available (Why is that?)
• On the pseudorandom function assumption in (secure) distance-bounding protocols. PRF-ness alone does not stop the frauds!

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)