Maybe Poor Johnny Really Cannot Encrypt: The Case for a Complexity Theory for Usable Security. Benenson, Z., Lenzini, G., Oliveira, D., Parkin, S., & Uebelacker, S. In Somayaji, A., van Oorschot, P. C., Mannan, M., & Böhme, R., editors, NSPW, pages 85-99, 2015. ACM.
Maybe Poor Johnny Really Cannot Encrypt: The Case for a Complexity Theory for Usable Security. [link]Link  Maybe Poor Johnny Really Cannot Encrypt: The Case for a Complexity Theory for Usable Security. [link]Paper  bibtex   
@inproceedings{conf/nspw/BenensonLOPU15,
  added-at = {2016-01-11T00:00:00.000+0100},
  author = {Benenson, Zinaida and Lenzini, Gabriele and Oliveira, Daniela and Parkin, Simon and Uebelacker, Sven},
  biburl = {http://www.bibsonomy.org/bibtex/20a2970856608080d4832e08705b28438/dblp},
  booktitle = {NSPW},
  crossref = {conf/nspw/2015},
  editor = {Somayaji, Anil and van Oorschot, Paul C. and Mannan, Mohammad and Böhme, Rainer},
  ee = {http://doi.acm.org/10.1145/2841113.2841120},
  interhash = {884245a5f57b3a9c83a6c48f97bbc090},
  intrahash = {0a2970856608080d4832e08705b28438},
  isbn = {978-1-4503-3754-0},
  keywords = {dblp},
  pages = {85-99},
  publisher = {ACM},
  timestamp = {2016-01-14T11:44:15.000+0100},
  title = {Maybe Poor Johnny Really Cannot Encrypt: The Case for a Complexity Theory for Usable Security.},
  url = {http://dblp.uni-trier.de/db/conf/nspw/nspw2015.html#BenensonLOPU15},
  year = 2015
}

Downloads: 0