scientific article; zbMATH DE number 2009963

zbMath1038.94551MaRDI QIDQ4434882

Nicholas J. Hopper, John Langford, Luis von Ahn

Publication date: 26 November 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560294.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Cryptography (94A60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (16)

Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ An exploration of combinatorial testing-based approaches to fault localization for explainable AI ⋮ Authentication in Constrained Settings ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Bankrupting Sybil despite churn ⋮ On our best behaviour ⋮ AI-Completeness: Using Deep Learning to Eliminate the Human Factor ⋮ Cryptography Using Captcha Puzzles ⋮ Distinguishing Distributions Using Chernoff Information ⋮ Chernoff-type direct product theorems ⋮ Communities, Random Walks, and Social Sybil Defense ⋮ MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty ⋮ Almost Optimal Bounds for Direct Product Threshold Theorem ⋮ Analysis and enhancement of a password authentication and update scheme based on elliptic curve cryptography ⋮ Turing Test as a Defining Feature of AI-Completeness ⋮ Scrypt Is Maximally Memory-Hard

This page was built for publication: