@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
}

{"_id":"eWiwLE6ZfoXZdK2St","bibbaseid":"benenson-lenzini-oliveira-parkin-uebelacker-maybepoorjohnnyreallycannotencryptthecaseforacomplexitytheoryforusablesecurity-2015","downloads":0,"creationDate":"2016-02-03T13:02:26.186Z","title":"Maybe Poor Johnny Really Cannot Encrypt: The Case for a Complexity Theory for Usable Security.","author_short":["Benenson, Z.","Lenzini, G.","Oliveira, D.","Parkin, S.","Uebelacker, S."],"year":2015,"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/simon steyskal?items=1000","bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2016-01-11T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Benenson"],"firstnames":["Zinaida"],"suffixes":[]},{"propositions":[],"lastnames":["Lenzini"],"firstnames":["Gabriele"],"suffixes":[]},{"propositions":[],"lastnames":["Oliveira"],"firstnames":["Daniela"],"suffixes":[]},{"propositions":[],"lastnames":["Parkin"],"firstnames":["Simon"],"suffixes":[]},{"propositions":[],"lastnames":["Uebelacker"],"firstnames":["Sven"],"suffixes":[]}],"biburl":"http://www.bibsonomy.org/bibtex/20a2970856608080d4832e08705b28438/dblp","booktitle":"NSPW","crossref":"conf/nspw/2015","editor":[{"propositions":[],"lastnames":["Somayaji"],"firstnames":["Anil"],"suffixes":[]},{"propositions":["van"],"lastnames":["Oorschot"],"firstnames":["Paul","C."],"suffixes":[]},{"propositions":[],"lastnames":["Mannan"],"firstnames":["Mohammad"],"suffixes":[]},{"propositions":[],"lastnames":["Böhme"],"firstnames":["Rainer"],"suffixes":[]}],"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","bibtex":"@inproceedings{conf/nspw/BenensonLOPU15,\n added-at = {2016-01-11T00:00:00.000+0100},\n author = {Benenson, Zinaida and Lenzini, Gabriele and Oliveira, Daniela and Parkin, Simon and Uebelacker, Sven},\n biburl = {http://www.bibsonomy.org/bibtex/20a2970856608080d4832e08705b28438/dblp},\n booktitle = {NSPW},\n crossref = {conf/nspw/2015},\n editor = {Somayaji, Anil and van Oorschot, Paul C. and Mannan, Mohammad and Böhme, Rainer},\n ee = {http://doi.acm.org/10.1145/2841113.2841120},\n interhash = {884245a5f57b3a9c83a6c48f97bbc090},\n intrahash = {0a2970856608080d4832e08705b28438},\n isbn = {978-1-4503-3754-0},\n keywords = {dblp},\n pages = {85-99},\n publisher = {ACM},\n timestamp = {2016-01-14T11:44:15.000+0100},\n title = {Maybe Poor Johnny Really Cannot Encrypt: The Case for a Complexity Theory for Usable Security.},\n url = {http://dblp.uni-trier.de/db/conf/nspw/nspw2015.html#BenensonLOPU15},\n year = 2015\n}\n\n","author_short":["Benenson, Z.","Lenzini, G.","Oliveira, D.","Parkin, S.","Uebelacker, S."],"editor_short":["Somayaji, A.","van Oorschot, P. C.","Mannan, M.","Böhme, R."],"key":"conf/nspw/BenensonLOPU15","id":"conf/nspw/BenensonLOPU15","bibbaseid":"benenson-lenzini-oliveira-parkin-uebelacker-maybepoorjohnnyreallycannotencryptthecaseforacomplexitytheoryforusablesecurity-2015","role":"author","urls":{"Link":"http://doi.acm.org/10.1145/2841113.2841120","Paper":"http://dblp.uni-trier.de/db/conf/nspw/nspw2015.html#BenensonLOPU15"},"keyword":["dblp"],"downloads":0},"search_terms":["maybe","poor","johnny","really","encrypt","case","complexity","theory","usable","security","benenson","lenzini","oliveira","parkin","uebelacker"],"keywords":["dblp"],"authorIDs":[],"dataSources":["qcMBJkGk4FzM4bdJY"]}