Home > Research > Publications & Outputs > Towards new security primitives based on hard A...

Links

Text available via DOI:

View graph of relations

Towards new security primitives based on hard AI problems

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Publication date2013
Host publicationSecurity Protocols XXI: 21st International Workshop, Cambridge, UK, March 19-20, 2013, Revised Selected Papers
EditorsBruce Christianson, James Malcolm, Frank Stajano, Jonathan Anderson, Joseph Bonneau
Place of PublicationBerlin
PublisherSpringer Verlag
Pages3-10
Number of pages8
ISBN (Electronic)9783642417177
ISBN (Print)9783642417160
<mark>Original language</mark>English
Event21st International Workshop on Security Protocols XXI - Cambridge, United Kingdom
Duration: 19/03/201320/03/2013

Conference

Conference21st International Workshop on Security Protocols XXI
Country/TerritoryUnited Kingdom
CityCambridge
Period19/03/1320/03/13

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8263
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Workshop on Security Protocols XXI
Country/TerritoryUnited Kingdom
CityCambridge
Period19/03/1320/03/13

Abstract

Many security primitives are based on hard mathematical problems. Using hard AI problems for security has emerged as an exciting new paradigm (with Captcha being the most successful example). However, this paradigm has achieved just a limited success, and has been under-explored. In this paper, we motivate and sketch a new security primitive based on hard AI problems.