Pages that link to "Item:Q3593090"
From MaRDI portal
The following pages link to Parallel and Concurrent Security of the HB and HB + Protocols (Q3593090):
Displaying 20 items.
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- Efficient RFID authentication protocols based on pseudorandom sequence generators (Q1009145) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- A protocol for provably secure authentication of a tiny entity to a high performance computing one (Q1793779) (← links)
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN (Q1981773) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Solving LPN using covering codes (Q2303453) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- How to Encrypt with the LPN Problem (Q3519542) (← links)
- On the Security of HB# against a Man-in-the-Middle Attack (Q3600368) (← links)
- Good Variants of HB + Are Hard to Find (Q3603007) (← links)
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model (Q3623048) (← links)
- (Q4638058) (← links)
- On Privacy Models for RFID (Q5387093) (← links)
- : Increasing the Security and Efficiency of (Q5458602) (← links)
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols (Q5962225) (← links)
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW (Q6135457) (← links)
- An iterative correction method for practically LPN solving (Q6576954) (← links)
