Cryptography Using Captcha Puzzles
From MaRDI portal
Publication:4916003
DOI10.1007/978-3-642-36362-7_7zbMath1314.94080OpenAlexW2214854691MaRDI QIDQ4916003
Rafail Ostrovsky, Akshay Wadia, Abishek Kumarasubramanian, Omkant Pandey
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_7
concurrent non-malleable zero-knowledgeuniversal composability\texttt{CAPTCHA}human-extractable \texttt{CAPTCHA}
Cryptography (94A60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- Composition of secure multi-party protocols. A comprehensive study.
- Lower bounds and impossibility results for concurrent self composition
- Local zero knowledge
- Universally composable two-party and multi-party secure computation
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Bounded-concurrent secure two-party computation without setup assumptions
- New and improved constructions of non-malleable cryptographic protocols
- Password-Authenticated Session-Key Generation on the Internet in the Plain Model
- How to Pair with a Human
- Adaptive One-Way Functions and Applications
- Noninteractive Zero-Knowledge
- Foundations of Cryptography
- Nonmalleable Cryptography
- A unified framework for concurrent security
- Advances in Cryptology – CRYPTO 2004
- Computational Complexity
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Advances in Cryptology - CRYPTO 2003
- Precise Concurrent Zero Knowledge
- Theory of Cryptography
- Mitigating Dictionary Attacks on Password-Protected Local Storage
