Optimal Proximity Proofs Revisited

DOI10.1007/978-3-319-28166-7_23zbMath1459.94121OpenAlexW2288410626MaRDI QIDQ2794513

Serge Vaudenay, Handan Kılınç

Publication date: 10 March 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/217021/files/chp3A10.10072F978-3-319-28166-7_23.pdf

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Short paper: Terrorist fraud in distance bounding: getting around the models ⋮ Efficient Public-Key Distance Bounding Protocol

Cites Work

• Secure and Lightweight Distance-Bounding
• On Modeling Terrorist Frauds
• Towards Secure Distance Bounding
• Optimal Proximity Proofs
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal Proximity Proofs Revisited