Authenticating Pervasive Devices with Human Protocols
From MaRDI portal
Publication:5451032
Recommendations
Cited in
(42)- Parallel and Concurrent Security of the HB and HB + Protocols
- Optimization of \(\mathsf {LPN}\) solving algorithms
- sLiSCP: Simeck-based permutations for lightweight sponge cryptographic primitives
- On solving LPN using BKW and variants, Implementation and analysis
- How to Encrypt with the LPN Problem
- Evaluation and cryptanalysis of the Pandaka lightweight cipher
- Towards efficient LPN-based symmetric encryption
- An iterative correction method for practically LPN solving
- On Privacy Models for RFID
- : Increasing the Security and Efficiency of
- Solving the learning parity with noise's open question
- Good Variants of HB + Are Hard to Find
- On the Security of HB# against a Man-in-the-Middle Attack
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- scientific article; zbMATH DE number 1962739 (Why is no real title available?)
- scientific article; zbMATH DE number 6866300 (Why is no real title available?)
- SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags
- Towards Provable Security for Ubiquitous Applications
- Bayesian authentication: quantifying security of the Hancke-Kuhn protocol
- Efficient RFID authentication protocols based on pseudorandom sequence generators
- BehavioCog: An Observation Resistant Authentication Scheme
- Low-cost cryptography for privacy in RFID systems
- Solving LPN using covering codes
- A protocol for provably secure authentication of a tiny entity to a high performance computing one
- The cryptographic power of random selection
- Cryptography with constant input locality
- Authentication protocols for reliable information provision systems with low computational-ability devices
- Cryptography from learning parity with noise
- Authentication in the bounded storage model
- When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack
- HB-MP: a further step in the HB-family of lightweight authentication protocols
- Code-based public-key cryptosystems and their applications
- Selected Areas in Cryptography
- Side-channel resistant crypto for less than 2,300 GE
- Efficient authentication from hard learning problems
- A secure authentication protocol for cholesteric spherical reflectors using homomorphic encryption
- Hash Functions and RFID Tags: Mind the Gap
- Two-round man-in-the-middle security from LPN
- BKW meets Fourier new algorithms for LPN with sparse parities
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
This page was built for publication: Authenticating Pervasive Devices with Human Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451032)
