Pages that link to "Item:Q4434882"
From MaRDI portal
The following pages link to CAPTCHA: Using hard AI problems for security (Q4434882):
Displaying 23 items.
- Synthetic handwritten CAPTCHAs (Q733107) (← links)
- Using CAPTCHA in computer steganography (Q904437) (← links)
- Chernoff-type direct product theorems (Q1027975) (← links)
- MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty (Q1032467) (← links)
- An exploration of combinatorial testing-based approaches to fault localization for explainable AI (Q2163858) (← links)
- Analysis and enhancement of a password authentication and update scheme based on elliptic curve cryptography (Q2336256) (← links)
- On our best behaviour (Q2453722) (← links)
- Bankrupting Sybil despite churn (Q2698290) (← links)
- Matrix problems to generate mosaic-based CAPTCHAs (Q2796465) (← links)
- Turing Test as a Defining Feature of AI-Completeness (Q2866100) (← links)
- Enhanced STE3D-CAP: A Novel 3D CAPTCHA Family (Q2894356) (← links)
- Authentication in Constrained Settings (Q2947097) (← links)
- reCAPTCHA: Human-Based Character Recognition via Web Security Measures (Q3101713) (← links)
- Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond (Q3181039) (← links)
- AI-Completeness: Using Deep Learning to Eliminate the Human Factor (Q3296993) (← links)
- Almost Optimal Bounds for Direct Product Threshold Theorem (Q3408186) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- Distinguishing Distributions Using Chernoff Information (Q4933218) (← links)
- Communities, Random Walks, and Social Sybil Defense (Q4985360) (← links)
- Resource Burning for Permissionless Systems (Invited Paper) (Q5100943) (← links)
- Scrypt Is Maximally Memory-Hard (Q5270357) (← links)
- Defending hash tables from algorithmic complexity attacks with resource burning (Q6614003) (← links)
- \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys (Q6618583) (← links)
