CAPTCHA: Using hard AI problems for security
From MaRDI portal
Recommendations
Cited in
(28)- Chernoff-type direct product theorems
- MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty
- An exploration of combinatorial testing-based approaches to fault localization for explainable AI
- Analysis and enhancement of a password authentication and update scheme based on elliptic curve cryptography
- On our best behaviour
- Bankrupting Sybil despite churn
- Matrix problems to generate mosaic-based CAPTCHAs
- Turing test as a defining feature of AI-completeness
- Enhanced STE3D-CAP: a novel 3D CAPTCHA family
- Authentication in constrained settings
- CAPTCHA phishing: a practical attack on human interaction proofing
- reCAPTCHA: human-based character recognition via web security measures
- Breaking a 3D-based CAPTCHA scheme
- Designing proof of human-work puzzles for cryptocurrency and beyond
- AI-completeness: using deep learning to eliminate the human factor
- Almost optimal bounds for direct product threshold theorem
- Human interactive proofs and document image analysis
- Cryptography using \texttt{CAPTCHA} puzzles
- Distinguishing distributions using Chernoff information
- Communities, Random Walks, and Social Sybil Defense
- Resource Burning for Permissionless Systems (Invited Paper)
- Reliability analysis of graphical CAPTCHA-systems by the example of KCAPTCHA
- Scrypt is maximally memory-hard
- Defending hash tables from algorithmic complexity attacks with resource burning
- \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys
- Bankrupting DoS attackers
- Synthetic handwritten CAPTCHAs
- Using CAPTCHA in computer steganography
This page was built for publication: CAPTCHA: Using hard AI problems for security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434882)
