scientific article; zbMATH DE number 6866300
From MaRDI portal
Publication:4638058
DOI10.4230/LIPIcs.ITCS.2017.10zbMath1402.94073arXiv1404.0024MaRDI QIDQ4638058
Manuel Blum, Jeremiah Blocki, Anupam Datta, Santosh Vempala
Publication date: 3 May 2018
Full work available at URL: https://arxiv.org/abs/1404.0024
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
passwordsstatistical dimensionhuman computationcognitive authenticationplanted constraint satisfaction problem
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)
Related Items (3)
On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack ⋮ Unnamed Item
Cites Work
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Naturally Rehearsing Passwords
- On the Complexity of Random Satisfiability Problems with Planted Solutions
- Candidate One-Way Functions Based on Expander Graphs
- Sampling-Based Approaches to Calculating Marginal Densities
- Parallel and Concurrent Security of the HB and HB + Protocols
- Authenticating Pervasive Devices with Human Protocols
- A Computing Procedure for Quantification Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
