var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://mariosgeorgiou.github.io/files/mypubs.bib\",\"jsonp\":\"1\",\"nocache\":\"1\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"New constructions for quantum money\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Georgiou\"],\"firstnames\":[\"Marios\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Kerenidis\"],\"firstnames\":[\"Iordanis\"],\"suffixes\":[]}],\"booktitle\":\"10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)\",\"year\":\"2015\",\"organization\":\"Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik\",\"url\":\"http://drops.dagstuhl.de/opus/volltexte/2015/5551/pdf/7.pdf\",\"abstract\":\"We propose an information theoretically secure secret-key quantum money scheme in which the verification of a coin is classical and consists of only one round; namely, a classical query from the user to the bank and an accept/reject answer from the bank to the user. A coin can be verified polynomially (on the number of its qubits) many times before it expires. Our scheme is an improvement on Gavinsky’s scheme, where three rounds of interaction are needed and is based on the notion of quantum retrieval games. Moreover, we propose a public-key quantum money scheme which uses one-time memories as a building block and is computationally secure in the random oracle model. This construction is derived naturally from our secret-key scheme using the fact that one-time memories are a special case of quantum retrieval games. \",\"bibtex\":\"@inproceedings{georgiou2015new,\\n  title={New constructions for quantum money},\\n  author={Georgiou, Marios and Kerenidis, Iordanis},\\n  booktitle={10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)},\\n  year={2015},\\n  organization={Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik},\\n  url={http://drops.dagstuhl.de/opus/volltexte/2015/5551/pdf/7.pdf},\\n  abstract = {We propose an information theoretically secure secret-key quantum money scheme in which the verification of a coin is classical and consists of only one round; namely, a classical query from the user to the bank and an accept/reject answer from the bank to the user. A coin can be verified polynomially (on the number of its qubits) many times before it expires. Our scheme is an improvement on Gavinsky’s scheme, where three rounds of interaction are needed and is based on the notion of quantum retrieval games.\\n  \\n  Moreover, we propose a public-key quantum money scheme which uses one-time memories as a building block and is computationally secure in the random oracle model. This construction is derived naturally from our secret-key scheme using the fact that one-time memories are a special case of quantum retrieval games.\\n}\\n}\\n\\n\",\"author_short\":[\"Georgiou, M.\",\"Kerenidis, I.\"],\"key\":\"georgiou2015new\",\"id\":\"georgiou2015new\",\"bibbaseid\":\"georgiou-kerenidis-newconstructionsforquantummoney-2015\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://drops.dagstuhl.de/opus/volltexte/2015/5551/pdf/7.pdf\"},\"metadata\":{\"authorlinks\":{\"georgiou, m\":\"https://mariosgeorgiou.github.io/publications/\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Cryptography with Disposable Backdoors\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Chung\"],\"firstnames\":[\"Kai-Min\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Georgiou\"],\"firstnames\":[\"Marios\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lai\"],\"firstnames\":[\"Ching-Yi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zikas\"],\"firstnames\":[\"Vassilis\"],\"suffixes\":[]}],\"journal\":\"Cryptography\",\"volume\":\"3\",\"number\":\"3\",\"pages\":\"22\",\"year\":\"2019\",\"url\":\"http://eprint.iacr.org/2018/352.pdf\",\"publisher\":\"Multidisciplinary Digital Publishing Institute\",\"abstract\":\"Backdooring cryptographic algorithms is an indisputable taboo in the cryptographic literature for a good reason: however noble the intentions, backdoors might fall in the wrong hands, in which case security is completely compromised. Nonetheless, more and more legislative pressure is being produced to enforce the use of such backdoors. In this work we introduce the concept of disposablecryptographic backdoors which can be used only once and become useless after that. These exotic primitives are impossible in the classical digital world without stateful and secure trusted hardware support, but, as we show, are feasible assuming quantum computation and access to classical stateless hardware tokens. Concretely, we construct a disposable (single-use) version of message authentication codes, and use them to derive a black-box construction of stateful hardware tokens in the above setting with quantum computation and classical stateless hardwaretokens. Thiscanbeviewedasagenerictransformationfromstatefultostatelesstokensand enables, among other things, one-time programs and memories. This is to our knowledge the first provablysecureconstructionofsuchprimitivesfromstatelesstokens.Asanapplicationofdisposable cryptographic backdoors we use our constructed primitive above to propose a middle-ground solution to the recent legislative push to backdoor cryptography: the conflict between Apple and FBI. We show that it is possible for Apple to create a one-time backdoor which unlocks any single device, and not even Apple can use it to unlock more than one, i.e., the backdoor becomes useless after it is used. We further describe how to use our ideas to derive a version of CCA-secure public key encryption, which is accompanied with a disposable (i.e., single-use, as in the above scenario) backdoor. \",\"bibtex\":\"@article{chung2019cryptography,\\n  title={Cryptography with Disposable Backdoors},\\n  author={Chung, Kai-Min and Georgiou, Marios and Lai, Ching-Yi and Zikas, Vassilis},\\n  journal={Cryptography},\\n  volume={3},\\n  number={3},\\n  pages={22},\\n  year={2019},\\n  url={http://eprint.iacr.org/2018/352.pdf},\\n  publisher={Multidisciplinary Digital Publishing Institute},\\n  abstract = {Backdooring cryptographic algorithms is an indisputable taboo in the cryptographic literature for a good reason: however noble the intentions, backdoors might fall in the wrong hands, in which case security is completely compromised. Nonetheless, more and more legislative pressure is being produced to enforce the use of such backdoors. In this work we introduce the concept of disposablecryptographic backdoors which can be used only once and become useless after that. These exotic primitives are impossible in the classical digital world without stateful and secure trusted hardware support, but, as we show, are feasible assuming quantum computation and access to classical stateless hardware tokens. Concretely, we construct a disposable (single-use) version of message authentication codes, and use them to derive a black-box construction of stateful hardware tokens in the above setting with quantum computation and classical stateless hardwaretokens. Thiscanbeviewedasagenerictransformationfromstatefultostatelesstokensand enables, among other things, one-time programs and memories. This is to our knowledge the first provablysecureconstructionofsuchprimitivesfromstatelesstokens.Asanapplicationofdisposable cryptographic backdoors we use our constructed primitive above to propose a middle-ground solution to the recent legislative push to backdoor cryptography: the conflict between Apple and FBI. We show that it is possible for Apple to create a one-time backdoor which unlocks any single device, and not even Apple can use it to unlock more than one, i.e., the backdoor becomes useless after it is used. We further describe how to use our ideas to derive a version of CCA-secure public key encryption, which is accompanied with a disposable (i.e., single-use, as in the above scenario) backdoor.\\n}\\n}\\n\\n\",\"author_short\":[\"Chung, K.\",\"Georgiou, M.\",\"Lai, C.\",\"Zikas, V.\"],\"key\":\"chung2019cryptography\",\"id\":\"chung2019cryptography\",\"bibbaseid\":\"chung-georgiou-lai-zikas-cryptographywithdisposablebackdoors-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://eprint.iacr.org/2018/352.pdf\"},\"metadata\":{\"authorlinks\":{\"georgiou, m\":\"https://mariosgeorgiou.github.io/publications/\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Ryan\"],\"propositions\":[],\"lastnames\":[\"Amos\"],\"suffixes\":[]},{\"firstnames\":[\"Marios\"],\"propositions\":[],\"lastnames\":[\"Georgiou\"],\"suffixes\":[]},{\"firstnames\":[\"Aggelos\"],\"propositions\":[],\"lastnames\":[\"Kiayias\"],\"suffixes\":[]},{\"firstnames\":[\"Mark\"],\"propositions\":[],\"lastnames\":[\"Zhandry\"],\"suffixes\":[]}],\"title\":\"One-shot Signatures and Applications to Hybrid Quantum/Classical Authentication\",\"booktitle\":\"Proceedings of STOC 2020\",\"misc\":\"Full version available at ˘rlhttps://eprint.iacr.org/2020/107\",\"year\":\"2020\",\"url\":\"http://eprint.iacr.org/2020/107\",\"abstract\":\"We define the notion of \\\\emphone-shot signatures, which are signatures where any secret key can be used to sign only a single message, and then self-destructs. While such signatures are of course impossible classically, we construct one-shot signatures using \\\\emphquantum no-cloning. In particular, we show that such signatures exist relative to a classical oracle, which we can then heuristically obfuscate using known indistinguishability obfuscation schemes. We show that one-shot signatures have numerous applications for hybrid quantum/classical cryptographic tasks, where all communication is required to be classical, but local quantum operations are allowed. Applications include one-time signature tokens, quantum money with classical communication, decentralized blockchain-less cryptocurrency, signature schemes with unclonable secret keys, non-interactive certifiable min-entropy, and more. We thus position one-shot signatures as a powerful new building block for novel quantum cryptographic protocols.\",\"bibtex\":\"@inproceedings{AGKZ20,\\n    author = {Ryan Amos and Marios Georgiou and Aggelos Kiayias and\\n              Mark Zhandry},\\n    title = {One-shot Signatures and Applications to Hybrid\\n             Quantum/Classical Authentication},\\n    booktitle = {Proceedings of STOC 2020},\\n    misc = {Full version available at\\n            \\\\url{https://eprint.iacr.org/2020/107}},\\n    year = {2020},\\n    url = {http://eprint.iacr.org/2020/107},\\n    abstract = {We define the notion of \\\\emph{one-shot signatures}, which are signatures where any secret key can be used to sign only a single message, and then self-destructs. While such signatures are of course impossible classically, we construct one-shot signatures using \\\\emph{quantum no-cloning}. In particular, we show that such signatures exist relative to a classical oracle, which we can then heuristically obfuscate using known indistinguishability obfuscation schemes.\\n\\nWe show that one-shot signatures have numerous applications for hybrid quantum/classical cryptographic tasks, where all communication is required to be classical, but local quantum operations are allowed. Applications include one-time signature tokens, quantum money with classical communication, decentralized blockchain-less cryptocurrency, signature schemes with unclonable secret keys, non-interactive certifiable min-entropy, and more. We thus position one-shot signatures as a powerful new building block for novel quantum cryptographic protocols.}\\n}\\n\\n\",\"author_short\":[\"Amos, R.\",\"Georgiou, M.\",\"Kiayias, A.\",\"Zhandry, M.\"],\"key\":\"AGKZ20\",\"id\":\"AGKZ20\",\"bibbaseid\":\"amos-georgiou-kiayias-zhandry-oneshotsignaturesandapplicationstohybridquantumclassicalauthentication-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://eprint.iacr.org/2020/107\"},\"metadata\":{\"authorlinks\":{\"georgiou, m\":\"https://mariosgeorgiou.github.io/publications/\"}},\"downloads\":8,\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"author\":[{\"firstnames\":[\"Marios\"],\"propositions\":[],\"lastnames\":[\"Georgiou\"],\"suffixes\":[]},{\"firstnames\":[\"Mark\"],\"propositions\":[],\"lastnames\":[\"Zhandry\"],\"suffixes\":[]}],\"title\":\"Unclonable Decryption Keys\",\"howpublished\":\"Cryptology ePrint Archive, Report 2020/877\",\"year\":\"2020\",\"url\":\"https://eprint.iacr.org/2020/877\",\"abstract\":\"We initiate the study of encryption schemes where the decryption keys are unclonable quantum objects, which we call \\\\emphsingle decryptor encryption. We give a number of initial results in this area: \\\\beginitemize ıtem We formalize the notion of single decryptor encryption. ıtem We show that secret-key single decryptor encryption is possible unconditionally, in the setting where a limited number of ciphertexts are given. However, given an encryption oracle, we show that unconditional security is impossible. ıtem We show how to use a very recent notion of \\\\emphone-shot signatures, together with sufficiently powerful witness encryption, to achieve public key single decryptor encryption. ıtem We demonstrate a number of extensions of our scheme, achieving a number of interesting properties that are not possible classically. \\\\enditemize ęywordsUnclonable decryption \\\\and Quantum decryption keys \\\\and Delayed decryption.\",\"bibtex\":\"@misc{GZ20,\\n    author = {Marios Georgiou and Mark Zhandry},\\n    title = {Unclonable Decryption Keys},\\n    howpublished = {Cryptology ePrint Archive, Report 2020/877},\\n    year = {2020},\\n    url = {https://eprint.iacr.org/2020/877},\\n    abstract = {We initiate the study of encryption schemes where the decryption keys are unclonable quantum objects, which we call \\\\emph{single decryptor} encryption. We give a number of initial results in this area:\\n\\\\begin{itemize}\\n    \\\\item We formalize the notion of single decryptor encryption.\\n    \\\\item We show that secret-key single decryptor encryption is possible unconditionally, in the setting where a limited number of ciphertexts are given. However, given an encryption oracle, we show that unconditional security is impossible.\\n    \\\\item We show how to use a very recent notion of \\\\emph{one-shot signatures}, together with sufficiently powerful witness encryption, to achieve public key single decryptor encryption.\\n    \\\\item We demonstrate a number of extensions of our scheme, achieving a number of interesting properties that are not possible classically.\\n\\\\end{itemize}\\n\\n\\\\keywords{Unclonable decryption  \\\\and Quantum decryption keys \\\\and Delayed decryption.}}\\n}\\n\\n\",\"author_short\":[\"Georgiou, M.\",\"Zhandry, M.\"],\"key\":\"GZ20\",\"id\":\"GZ20\",\"bibbaseid\":\"georgiou-zhandry-unclonabledecryptionkeys-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://eprint.iacr.org/2020/877\"},\"metadata\":{\"authorlinks\":{\"georgiou, m\":\"https://mariosgeorgiou.github.io/publications/\"}},\"downloads\":5,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Security Foundations for Application-Based Covert Communication Channels\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Howes\"],\"firstnames\":[\"James\",\"K\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Georgiou\"],\"firstnames\":[\"Marios\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Malozemoff\"],\"firstnames\":[\"Alex\",\"J\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Shrimpton\"],\"firstnames\":[\"Thomas\"],\"suffixes\":[]}],\"booktitle\":\"2022 IEEE Symposium on Security and Privacy (SP)\",\"pages\":\"1527–1527\",\"year\":\"2022\",\"organization\":\"IEEE Computer Society\",\"bibtex\":\"@inproceedings{howes2022security,\\n  title={Security Foundations for Application-Based Covert Communication Channels},\\n  author={Howes, James K and Georgiou, Marios and Malozemoff, Alex J and Shrimpton, Thomas},\\n  booktitle={2022 IEEE Symposium on Security and Privacy (SP)},\\n  pages={1527--1527},\\n  year={2022},\\n  organization={IEEE Computer Society}\\n}\\n\\n\",\"author_short\":[\"Howes, J. K\",\"Georgiou, M.\",\"Malozemoff, A. J\",\"Shrimpton, T.\"],\"key\":\"howes2022security\",\"id\":\"howes2022security\",\"bibbaseid\":\"howes-georgiou-malozemoff-shrimpton-securityfoundationsforapplicationbasedcovertcommunicationchannels-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"georgiou, m\":\"https://mariosgeorgiou.github.io/publications/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Towards a Formal Treatment of Logic Locking\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Beerel\"],\"firstnames\":[\"Peter\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Georgiou\"],\"firstnames\":[\"Marios\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hamlin\"],\"firstnames\":[\"Ben\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Malozemoff\"],\"firstnames\":[\"Alex\",\"J\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Nuzzo\"],\"firstnames\":[\"Pierluigi\"],\"suffixes\":[]}],\"journal\":\"IACR Transactions on Cryptographic Hardware and Embedded Systems\",\"pages\":\"92–114\",\"year\":\"2022\",\"bibtex\":\"@article{beerel2022towards,\\n  title={Towards a Formal Treatment of Logic Locking},\\n  author={Beerel, Peter and Georgiou, Marios and Hamlin, Ben and Malozemoff, Alex J and Nuzzo, Pierluigi},\\n  journal={IACR Transactions on Cryptographic Hardware and Embedded Systems},\\n  pages={92--114},\\n  year={2022}\\n}\\n\",\"author_short\":[\"Beerel, P.\",\"Georgiou, M.\",\"Hamlin, B.\",\"Malozemoff, A. J\",\"Nuzzo, P.\"],\"key\":\"beerel2022towards\",\"id\":\"beerel2022towards\",\"bibbaseid\":\"beerel-georgiou-hamlin-malozemoff-nuzzo-towardsaformaltreatmentoflogiclocking-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"georgiou, m\":\"https://mariosgeorgiou.github.io/publications/\"}},\"html\":\"\"}],\n      metadata: {\"owner\":\"georgiou, m\",\"authorlinks\":{\"georgiou, m\":\"https://mariosgeorgiou.github.io/publications/\"}},\n      ownerID: \"rwFNThr5PijAA952T\"\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"mypubs.bib\" href=\"data:text/bibtex;base64,@inproceedings{georgiou2015new,
  title={New constructions for quantum money},
  author={Georgiou, Marios and Kerenidis, Iordanis},
  booktitle={10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)},
  year={2015},
  organization={Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik},
  url={http://drops.dagstuhl.de/opus/volltexte/2015/5551/pdf/7.pdf},
  abstract = {We propose an information theoretically secure secret-key quantum money scheme in which the veriﬁcation of a coin is classical and consists of only one round; namely, a classical query from the user to the bank and an accept/reject answer from the bank to the user. A coin can be veriﬁed polynomially (on the number of its qubits) many times before it expires. Our scheme is an improvement on Gavinsky’s scheme, where three rounds of interaction are needed and is based on the notion of quantum retrieval games.
  
  Moreover, we propose a public-key quantum money scheme which uses one-time memories as a building block and is computationally secure in the random oracle model. This construction is derived naturally from our secret-key scheme using the fact that one-time memories are a special case of quantum retrieval games.
}
}



@article{chung2019cryptography,
  title={Cryptography with Disposable Backdoors},
  author={Chung, Kai-Min and Georgiou, Marios and Lai, Ching-Yi and Zikas, Vassilis},
  journal={Cryptography},
  volume={3},
  number={3},
  pages={22},
  year={2019},
  url={http://eprint.iacr.org/2018/352.pdf},
  publisher={Multidisciplinary Digital Publishing Institute},
  abstract = {Backdooring cryptographic algorithms is an indisputable taboo in the cryptographic literature for a good reason: however noble the intentions, backdoors might fall in the wrong hands, in which case security is completely compromised. Nonetheless, more and more legislative pressure is being produced to enforce the use of such backdoors. In this work we introduce the concept of disposablecryptographic backdoors which can be used only once and become useless after that. These exotic primitives are impossible in the classical digital world without stateful and secure trusted hardware support, but, as we show, are feasible assuming quantum computation and access to classical stateless hardware tokens. Concretely, we construct a disposable (single-use) version of message authentication codes, and use them to derive a black-box construction of stateful hardware tokens in the above setting with quantum computation and classical stateless hardwaretokens. Thiscanbeviewedasagenerictransformationfromstatefultostatelesstokensand enables, among other things, one-time programs and memories. This is to our knowledge the ﬁrst provablysecureconstructionofsuchprimitivesfromstatelesstokens.Asanapplicationofdisposable cryptographic backdoors we use our constructed primitive above to propose a middle-ground solution to the recent legislative push to backdoor cryptography: the conﬂict between Apple and FBI. We show that it is possible for Apple to create a one-time backdoor which unlocks any single device, and not even Apple can use it to unlock more than one, i.e., the backdoor becomes useless after it is used. We further describe how to use our ideas to derive a version of CCA-secure public key encryption, which is accompanied with a disposable (i.e., single-use, as in the above scenario) backdoor.
}
}



@inproceedings{AGKZ20,
    author = {Ryan Amos and Marios Georgiou and Aggelos Kiayias and
              Mark Zhandry},
    title = {One-shot Signatures and Applications to Hybrid
             Quantum/Classical Authentication},
    booktitle = {Proceedings of STOC 2020},
    misc = {Full version available at
            \url{https://eprint.iacr.org/2020/107}},
    year = {2020},
    url = {http://eprint.iacr.org/2020/107},
    abstract = {We define the notion of \emph{one-shot signatures}, which are signatures where any secret key can be used to sign only a single message, and then self-destructs. While such signatures are of course impossible classically, we construct one-shot signatures using \emph{quantum no-cloning}. In particular, we show that such signatures exist relative to a classical oracle, which we can then heuristically obfuscate using known indistinguishability obfuscation schemes.

We show that one-shot signatures have numerous applications for hybrid quantum/classical cryptographic tasks, where all communication is required to be classical, but local quantum operations are allowed. Applications include one-time signature tokens, quantum money with classical communication, decentralized blockchain-less cryptocurrency, signature schemes with unclonable secret keys, non-interactive certifiable min-entropy, and more. We thus position one-shot signatures as a powerful new building block for novel quantum cryptographic protocols.}
}



@misc{GZ20,
    author = {Marios Georgiou and Mark Zhandry},
    title = {Unclonable Decryption Keys},
    howpublished = {Cryptology ePrint Archive, Report 2020/877},
    year = {2020},
    url = {https://eprint.iacr.org/2020/877},
    abstract = {We initiate the study of encryption schemes where the decryption keys are unclonable quantum objects, which we call \emph{single decryptor} encryption. We give a number of initial results in this area:
\begin{itemize}
    \item We formalize the notion of single decryptor encryption.
    \item We show that secret-key single decryptor encryption is possible unconditionally, in the setting where a limited number of ciphertexts are given. However, given an encryption oracle, we show that unconditional security is impossible.
    \item We show how to use a very recent notion of \emph{one-shot signatures}, together with sufficiently powerful witness encryption, to achieve public key single decryptor encryption.
    \item We demonstrate a number of extensions of our scheme, achieving a number of interesting properties that are not possible classically.
\end{itemize}

\keywords{Unclonable decryption  \and Quantum decryption keys \and Delayed decryption.}}
}



@inproceedings{howes2022security,
  title={Security Foundations for Application-Based Covert Communication Channels},
  author={Howes, James K and Georgiou, Marios and Malozemoff, Alex J and Shrimpton, Thomas},
  booktitle={2022 IEEE Symposium on Security and Privacy (SP)},
  pages={1527--1527},
  year={2022},
  organization={IEEE Computer Society}
}



@article{beerel2022towards,
  title={Towards a Formal Treatment of Logic Locking},
  author={Beerel, Peter and Georgiou, Marios and Hamlin, Ben and Malozemoff, Alex J and Nuzzo, Pierluigi},
  journal={IACR Transactions on Cryptographic Hardware and Embedded Systems},
  pages={92--114},
  year={2022}
}
\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://mariosgeorgiou.github.io/files/mypubs.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://mariosgeorgiou.github.io/files/mypubs.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fmariosgeorgiou.github.io%2Ffiles%2Fmypubs.bib&amp;jsonp=1&amp;nocache=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fmariosgeorgiou.github.io%2Ffiles%2Fmypubs.bib&amp;jsonp=1&amp;nocache=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fmariosgeorgiou.github.io%2Ffiles%2Fmypubs.bib&amp;jsonp=1&amp;nocache=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"howes-georgiou-malozemoff-shrimpton-securityfoundationsforapplicationbasedcovertcommunicationchannels-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Security Foundations for Application-Based Covert Communication Channels.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Howes, J. K; <a class=\"bibbase author link\" href=\"https://mariosgeorgiou.github.io/publications/\">Georgiou, M.</a>; Malozemoff, A. J;  and Shrimpton, T.\n</span>\n\n  \n\n</span>\n\n  In <i>2022 IEEE Symposium on Security and Privacy (SP)</i>, pages 1527–1527,  2022. IEEE Computer Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/howes-georgiou-malozemoff-shrimpton-securityfoundationsforapplicationbasedcovertcommunicationchannels-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('howes-georgiou-malozemoff-shrimpton-securityfoundationsforapplicationbasedcovertcommunicationchannels-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{howes2022security,\n  title={Security Foundations for Application-Based Covert Communication Channels},\n  author={Howes, James K and Georgiou, Marios and Malozemoff, Alex J and Shrimpton, Thomas},\n  booktitle={2022 IEEE Symposium on Security and Privacy (SP)},\n  pages={1527--1527},\n  year={2022},\n  organization={IEEE Computer Society}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"beerel-georgiou-hamlin-malozemoff-nuzzo-towardsaformaltreatmentoflogiclocking-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Towards a Formal Treatment of Logic Locking.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Beerel, P.; <a class=\"bibbase author link\" href=\"https://mariosgeorgiou.github.io/publications/\">Georgiou, M.</a>; Hamlin, B.; Malozemoff, A. J;  and Nuzzo, P.\n</span>\n\n  \n\n</span>\n\n  <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>,92–114.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/beerel-georgiou-hamlin-malozemoff-nuzzo-towardsaformaltreatmentoflogiclocking-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('beerel-georgiou-hamlin-malozemoff-nuzzo-towardsaformaltreatmentoflogiclocking-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{beerel2022towards,\n  title={Towards a Formal Treatment of Logic Locking},\n  author={Beerel, Peter and Georgiou, Marios and Hamlin, Ben and Malozemoff, Alex J and Nuzzo, Pierluigi},\n  journal={IACR Transactions on Cryptographic Hardware and Embedded Systems},\n  pages={92--114},\n  year={2022}\n}\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"amos-georgiou-kiayias-zhandry-oneshotsignaturesandapplicationstohybridquantumclassicalauthentication-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://eprint.iacr.org/2020/107\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'amos-georgiou-kiayias-zhandry-oneshotsignaturesandapplicationstohybridquantumclassicalauthentication-2020', 'http://eprint.iacr.org/2020/107', event);\">\n    One-shot Signatures and Applications to Hybrid Quantum/Classical Authentication.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Amos, R.; <a class=\"bibbase author link\" href=\"https://mariosgeorgiou.github.io/publications/\">Georgiou, M.</a>; Kiayias, A.;  and Zhandry, M.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of STOC 2020</i>,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://eprint.iacr.org/2020/107\"\n     onclick=\"log_download('amos-georgiou-kiayias-zhandry-oneshotsignaturesandapplicationstohybridquantumclassicalauthentication-2020', 'http://eprint.iacr.org/2020/107', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"One-shot Signatures and Applications to Hybrid Quantum/Classical Authentication [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/amos-georgiou-kiayias-zhandry-oneshotsignaturesandapplicationstohybridquantumclassicalauthentication-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>8 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('amos-georgiou-kiayias-zhandry-oneshotsignaturesandapplicationstohybridquantumclassicalauthentication-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{AGKZ20,\n    author = {Ryan Amos and Marios Georgiou and Aggelos Kiayias and\n              Mark Zhandry},\n    title = {One-shot Signatures and Applications to Hybrid\n             Quantum/Classical Authentication},\n    booktitle = {Proceedings of STOC 2020},\n    misc = {Full version available at\n            \\url{https://eprint.iacr.org/2020/107}},\n    year = {2020},\n    url = {http://eprint.iacr.org/2020/107},\n    abstract = {We define the notion of \\emph{one-shot signatures}, which are signatures where any secret key can be used to sign only a single message, and then self-destructs. While such signatures are of course impossible classically, we construct one-shot signatures using \\emph{quantum no-cloning}. In particular, we show that such signatures exist relative to a classical oracle, which we can then heuristically obfuscate using known indistinguishability obfuscation schemes.\n\nWe show that one-shot signatures have numerous applications for hybrid quantum/classical cryptographic tasks, where all communication is required to be classical, but local quantum operations are allowed. Applications include one-time signature tokens, quantum money with classical communication, decentralized blockchain-less cryptocurrency, signature schemes with unclonable secret keys, non-interactive certifiable min-entropy, and more. We thus position one-shot signatures as a powerful new building block for novel quantum cryptographic protocols.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We define the notion of \\emphone-shot signatures, which are signatures where any secret key can be used to sign only a single message, and then self-destructs. While such signatures are of course impossible classically, we construct one-shot signatures using \\emphquantum no-cloning. In particular, we show that such signatures exist relative to a classical oracle, which we can then heuristically obfuscate using known indistinguishability obfuscation schemes. We show that one-shot signatures have numerous applications for hybrid quantum/classical cryptographic tasks, where all communication is required to be classical, but local quantum operations are allowed. Applications include one-time signature tokens, quantum money with classical communication, decentralized blockchain-less cryptocurrency, signature schemes with unclonable secret keys, non-interactive certifiable min-entropy, and more. We thus position one-shot signatures as a powerful new building block for novel quantum cryptographic protocols.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"georgiou-zhandry-unclonabledecryptionkeys-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://eprint.iacr.org/2020/877\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'georgiou-zhandry-unclonabledecryptionkeys-2020', 'https://eprint.iacr.org/2020/877', event);\">\n    Unclonable Decryption Keys.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://mariosgeorgiou.github.io/publications/\">Georgiou, M.</a>;  and Zhandry, M.\n</span>\n\n  \n\n</span>\n\n  Cryptology ePrint Archive, Report 2020/877,  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://eprint.iacr.org/2020/877\"\n     onclick=\"log_download('georgiou-zhandry-unclonabledecryptionkeys-2020', 'https://eprint.iacr.org/2020/877', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Unclonable Decryption Keys [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/georgiou-zhandry-unclonabledecryptionkeys-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>5 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('georgiou-zhandry-unclonabledecryptionkeys-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{GZ20,\n    author = {Marios Georgiou and Mark Zhandry},\n    title = {Unclonable Decryption Keys},\n    howpublished = {Cryptology ePrint Archive, Report 2020/877},\n    year = {2020},\n    url = {https://eprint.iacr.org/2020/877},\n    abstract = {We initiate the study of encryption schemes where the decryption keys are unclonable quantum objects, which we call \\emph{single decryptor} encryption. We give a number of initial results in this area:\n\\begin{itemize}\n    \\item We formalize the notion of single decryptor encryption.\n    \\item We show that secret-key single decryptor encryption is possible unconditionally, in the setting where a limited number of ciphertexts are given. However, given an encryption oracle, we show that unconditional security is impossible.\n    \\item We show how to use a very recent notion of \\emph{one-shot signatures}, together with sufficiently powerful witness encryption, to achieve public key single decryptor encryption.\n    \\item We demonstrate a number of extensions of our scheme, achieving a number of interesting properties that are not possible classically.\n\\end{itemize}\n\n\\keywords{Unclonable decryption  \\and Quantum decryption keys \\and Delayed decryption.}}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We initiate the study of encryption schemes where the decryption keys are unclonable quantum objects, which we call \\emphsingle decryptor encryption. We give a number of initial results in this area: \\beginitemize ıtem We formalize the notion of single decryptor encryption. ıtem We show that secret-key single decryptor encryption is possible unconditionally, in the setting where a limited number of ciphertexts are given. However, given an encryption oracle, we show that unconditional security is impossible. ıtem We show how to use a very recent notion of \\emphone-shot signatures, together with sufficiently powerful witness encryption, to achieve public key single decryptor encryption. ıtem We demonstrate a number of extensions of our scheme, achieving a number of interesting properties that are not possible classically. \\enditemize ęywordsUnclonable decryption \\and Quantum decryption keys \\and Delayed decryption.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"chung-georgiou-lai-zikas-cryptographywithdisposablebackdoors-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://eprint.iacr.org/2018/352.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'chung-georgiou-lai-zikas-cryptographywithdisposablebackdoors-2019', 'http://eprint.iacr.org/2018/352.pdf', event);\">\n    Cryptography with Disposable Backdoors.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Chung, K.; <a class=\"bibbase author link\" href=\"https://mariosgeorgiou.github.io/publications/\">Georgiou, M.</a>; Lai, C.;  and Zikas, V.\n</span>\n\n  \n\n</span>\n\n  <i>Cryptography</i>, 3(3): 22.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://eprint.iacr.org/2018/352.pdf\"\n     onclick=\"log_download('chung-georgiou-lai-zikas-cryptographywithdisposablebackdoors-2019', 'http://eprint.iacr.org/2018/352.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Cryptography with Disposable Backdoors [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chung-georgiou-lai-zikas-cryptographywithdisposablebackdoors-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chung-georgiou-lai-zikas-cryptographywithdisposablebackdoors-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{chung2019cryptography,\n  title={Cryptography with Disposable Backdoors},\n  author={Chung, Kai-Min and Georgiou, Marios and Lai, Ching-Yi and Zikas, Vassilis},\n  journal={Cryptography},\n  volume={3},\n  number={3},\n  pages={22},\n  year={2019},\n  url={http://eprint.iacr.org/2018/352.pdf},\n  publisher={Multidisciplinary Digital Publishing Institute},\n  abstract = {Backdooring cryptographic algorithms is an indisputable taboo in the cryptographic literature for a good reason: however noble the intentions, backdoors might fall in the wrong hands, in which case security is completely compromised. Nonetheless, more and more legislative pressure is being produced to enforce the use of such backdoors. In this work we introduce the concept of disposablecryptographic backdoors which can be used only once and become useless after that. These exotic primitives are impossible in the classical digital world without stateful and secure trusted hardware support, but, as we show, are feasible assuming quantum computation and access to classical stateless hardware tokens. Concretely, we construct a disposable (single-use) version of message authentication codes, and use them to derive a black-box construction of stateful hardware tokens in the above setting with quantum computation and classical stateless hardwaretokens. Thiscanbeviewedasagenerictransformationfromstatefultostatelesstokensand enables, among other things, one-time programs and memories. This is to our knowledge the first provablysecureconstructionofsuchprimitivesfromstatelesstokens.Asanapplicationofdisposable cryptographic backdoors we use our constructed primitive above to propose a middle-ground solution to the recent legislative push to backdoor cryptography: the conflict between Apple and FBI. We show that it is possible for Apple to create a one-time backdoor which unlocks any single device, and not even Apple can use it to unlock more than one, i.e., the backdoor becomes useless after it is used. We further describe how to use our ideas to derive a version of CCA-secure public key encryption, which is accompanied with a disposable (i.e., single-use, as in the above scenario) backdoor.\n}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Backdooring cryptographic algorithms is an indisputable taboo in the cryptographic literature for a good reason: however noble the intentions, backdoors might fall in the wrong hands, in which case security is completely compromised. Nonetheless, more and more legislative pressure is being produced to enforce the use of such backdoors. In this work we introduce the concept of disposablecryptographic backdoors which can be used only once and become useless after that. These exotic primitives are impossible in the classical digital world without stateful and secure trusted hardware support, but, as we show, are feasible assuming quantum computation and access to classical stateless hardware tokens. Concretely, we construct a disposable (single-use) version of message authentication codes, and use them to derive a black-box construction of stateful hardware tokens in the above setting with quantum computation and classical stateless hardwaretokens. Thiscanbeviewedasagenerictransformationfromstatefultostatelesstokensand enables, among other things, one-time programs and memories. This is to our knowledge the first provablysecureconstructionofsuchprimitivesfromstatelesstokens.Asanapplicationofdisposable cryptographic backdoors we use our constructed primitive above to propose a middle-ground solution to the recent legislative push to backdoor cryptography: the conflict between Apple and FBI. We show that it is possible for Apple to create a one-time backdoor which unlocks any single device, and not even Apple can use it to unlock more than one, i.e., the backdoor becomes useless after it is used. We further describe how to use our ideas to derive a version of CCA-secure public key encryption, which is accompanied with a disposable (i.e., single-use, as in the above scenario) backdoor. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"georgiou-kerenidis-newconstructionsforquantummoney-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://drops.dagstuhl.de/opus/volltexte/2015/5551/pdf/7.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'georgiou-kerenidis-newconstructionsforquantummoney-2015', 'http://drops.dagstuhl.de/opus/volltexte/2015/5551/pdf/7.pdf', event);\">\n    New constructions for quantum money.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://mariosgeorgiou.github.io/publications/\">Georgiou, M.</a>;  and Kerenidis, I.\n</span>\n\n  \n\n</span>\n\n  In <i>10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)</i>,  2015. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://drops.dagstuhl.de/opus/volltexte/2015/5551/pdf/7.pdf\"\n     onclick=\"log_download('georgiou-kerenidis-newconstructionsforquantummoney-2015', 'http://drops.dagstuhl.de/opus/volltexte/2015/5551/pdf/7.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"New constructions for quantum money [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/georgiou-kerenidis-newconstructionsforquantummoney-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('georgiou-kerenidis-newconstructionsforquantummoney-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{georgiou2015new,\n  title={New constructions for quantum money},\n  author={Georgiou, Marios and Kerenidis, Iordanis},\n  booktitle={10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)},\n  year={2015},\n  organization={Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik},\n  url={http://drops.dagstuhl.de/opus/volltexte/2015/5551/pdf/7.pdf},\n  abstract = {We propose an information theoretically secure secret-key quantum money scheme in which the verification of a coin is classical and consists of only one round; namely, a classical query from the user to the bank and an accept/reject answer from the bank to the user. A coin can be verified polynomially (on the number of its qubits) many times before it expires. Our scheme is an improvement on Gavinsky’s scheme, where three rounds of interaction are needed and is based on the notion of quantum retrieval games.\n  \n  Moreover, we propose a public-key quantum money scheme which uses one-time memories as a building block and is computationally secure in the random oracle model. This construction is derived naturally from our secret-key scheme using the fact that one-time memories are a special case of quantum retrieval games.\n}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We propose an information theoretically secure secret-key quantum money scheme in which the verification of a coin is classical and consists of only one round; namely, a classical query from the user to the bank and an accept/reject answer from the bank to the user. A coin can be verified polynomially (on the number of its qubits) many times before it expires. Our scheme is an improvement on Gavinsky’s scheme, where three rounds of interaction are needed and is based on the notion of quantum retrieval games. Moreover, we propose a public-key quantum money scheme which uses one-time memories as a building block and is computationally secure in the random oracle model. This construction is derived naturally from our secret-key scheme using the fact that one-time memories are a special case of quantum retrieval games. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);