diff --git a/content/paper/2006.01.md b/content/paper/2006.01.md new file mode 100644 index 0000000..7aedc7d --- /dev/null +++ b/content/paper/2006.01.md @@ -0,0 +1,17 @@ +--- +title: "Algorithmic Problems in Synthesized Cryptosystems" +authors: [ + "Andrew M Marshall", + "Catherine A Meadows", + "Paliath Narendran", + "Veena Ravishankar", + "Brandon Rozek" +] +publish_date: "2020/6" +conference: "International Workshop on Unification" +firstpage: 58 +lastpage: 63 +language: "English" +pdf_url: "https://www3.risc.jku.at/publications/download/risc_6129/proceedings-UNIF2020.pdf#page=58" +--- + diff --git a/content/paper/2109.01.md b/content/paper/2109.01.md new file mode 100644 index 0000000..35a93a9 --- /dev/null +++ b/content/paper/2109.01.md @@ -0,0 +1,28 @@ +--- +title: "Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems" +authors: [ + "Hai Lin", + "Christopher Lynch", + "Andrew M Marshall", + "Catherine A Meadows", + "Paliath Narendran", + "Veena Ravishankar", + "Brandon Rozek" +] +publish_date: "2021/09/08" +conference: "International Symposium on Frontiers of Combining Systems" +isbn: "978-3-030-86205-3" +doi: "10.1007/978-3-030-86205-3_14" +volume: 12941 +firstpage: 253 +lastpage: 270 +language: "English" +keywords: [ + "Cryptographic modes of operation", + "Symbolic reasoning", + "Equational theories", + "Unification" +] +abstract: "Automated methods can be used to generate cryptosystems by combining the primitives in an arbitrary fashion, to weed out insecure cryptosystems, and to prove the security of those that survive. In this paper, we study several algorithmic problems arising from the verification of automatically synthesized cryptosystems built from block ciphers, in a theory that includes ACUN. One of these is static equivalence to an algorithm that produces a sequence of random terms. The other is invertibility, the problem of determining whether, given an automatically synthesized cryptosystem, built from block ciphers, and the ability to compute inverses, is it always possible to compute the original plaintext from the ciphertext? We show that static equivalence to random in this theory is undecidable in general. In addition, we identify a reasonable special case for which there is a decidable condition implying security, along with an algorithm for verifying it. For invertibility, we identify a reasonable class of cryptosystems for which invertibility is equivalent to a simple syntactic condition that can be easily verified." +--- + diff --git a/content/paper/2203.01.md b/content/paper/2203.01.md new file mode 100644 index 0000000..a4ef7dc --- /dev/null +++ b/content/paper/2203.01.md @@ -0,0 +1,36 @@ +--- +title: "CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms" +authors: [ + "Dalton Chichester", + "Wei Du", + "Raymond Kauffman", + "Hai Lin", + "Christopher Lynch", + "Andrew M. Marshall", + "Catherine A. Meadows", + "Paliath Narendran", + "Veena Ravishankar", + "Luis Rovira", + "Brandon Rozek" +] +publish_date: "2022/3/14" +conference: "International Workshop on Rewriting Logic and its Applications" +firstpage: 6 +lastpage: 25 +language: "English" +pdf_url: "http://sv.postech.ac.kr/wrla2022/assets/files/pre-proceedings-WRLA2022.pdf#page=12" +abstract: "We present a new tool for the automatic synthesis and verifi- +cation of cryptographic algorithms. Currently the tool considers symbolic +security and invertibility of recursively defined modes of operation with +an xor-operation and encryption. A cryptographic mode of operation is +an algorithm for encrypting a message of arbitrary length using a block +cipher that only encrypts messages of a single fixed length. The system +can both automatically generate modes and accept user-defined ones. +These modes can then be checked for properties such as security and +invertibility. In order to analyze the modes, the tool utilizes term rewrit- +ing and unification methods which are implemented in a core supporting +library. The state of the tool and underlying library are in an initial iter- +ation. The goal is to continue expanding the tool to consider additional +security questions and cryptosystems." +--- + diff --git a/content/paper/2207.01.md b/content/paper/2207.01.md new file mode 100644 index 0000000..d9c9c96 --- /dev/null +++ b/content/paper/2207.01.md @@ -0,0 +1,34 @@ +--- +title: "A Framework for Testimony-Infused Automated Adjudicative Dynamic +Multi-Agent Reasoning in Ethically Charged Scenarios" +authors: [ + "Brandon Rozek", + "Michael Giancola", + "Selmer Bringsjord", + "Naveen Sundar Govindarajulu" +] +publish_date: "2022/07" +conference: "International Conference on Robot Ethics and Standards" +isbn: "978-1-7396142-0-1" +doi: "10.13180/icres.2022.18-19.07.009" +firstpage: 47 +lastpage: 66 +language: "English" +pdf_url: "https://www.clawar.org/icres2022/wp-content/uploads/2022/07/ICRES2022-Proceedings-manuscript.pdf#page=61" +abstract: "In “high stakes” multi-agent decision-making under uncertainty, testimonial evidence flows from +“witness” agents to “adjudicator” agents, where the latter must rationally fix belief and knowl- +edge, and act accordingly. The testimonies provided may be incomplete or even deceptive, and +in many domains are offered in a context that includes other kinds of evidence, some of which +may be incompatible with these testimonies. Therefore, before believing a testimony and on that +basis moving forward, the adjudicator must systematically reason to suitable strength of belief, in +a manner that takes account of said context, and globally judges the core issue at hand. To fur- +ther complicate matters, since the relevant information perceived by the adjudicator changes over +time, adjudication is a nonmonontonic/defeasible affair: adjudicators must dynamically strengthen, +weaken, defeat, and reinstate belief and knowledge. Toward the engineering of artificial agents ca- +pable of handling these representation-and-reasoning demands arising from testimonial evidence +in multi-agent decision-making, we explore herein extensions to one of our prior cognitive calculi: +the Inductive Cognitive Event Calculus (IDCEC). We ground these extensions in a recent, tragic +drone-strike scenario that unfolded in Kabul, Afghanistan, in the hope that use by humans of our +brand of logic-based AI in future such scenarios will save human lives." +--- + diff --git a/content/paper/2209.01.md b/content/paper/2209.01.md new file mode 100644 index 0000000..a93d0a1 --- /dev/null +++ b/content/paper/2209.01.md @@ -0,0 +1,34 @@ +--- +draft: true +title: "CryptoSolve: A Tool for the Analysis of Cryptographic Modes of Operation" +authors: [ + "Dalton Chichester", + "Wei Du", + "Raymond Kauffman", + "Hai Lin", + "Christopher Lynch", + "Andrew M. Marshall", + "Catherine Meadows", + "Paliath Narendran", + "Veena Ravishankar", + "Luis Rovira", + "Brandon Rozek" +] +publish_date: "2022/09" +conference: "International Symposium on Games, Automata, Logic, and Formal Verification" + + +issn: "" +isbn: "" +doi: "" +volume: 0 +issue: 0 +firstpage: 0 +lastpage: 0 +language: "English" +keywords: [] + +pdf_url: "" +abstract: "" +--- + diff --git a/content/publications.md b/content/publications.md index 8e8cce4..c9953f5 100644 --- a/content/publications.md +++ b/content/publications.md @@ -8,19 +8,34 @@ aliases: ## Publications -D Chichester, W Du, R Kauffman, H Lin, C Lynch, A M. Marshall, C Meadows, P Narendran, V Ravishankar, L Rovira, **B Rozek**. "CryptoSolve: A Tool for the Analysis of Cryptographic Modes of Operation", International Symposium on Games, Automata, Logic, and Formal Verification, 2022. +CryptoSolve: A Tool for the Analysis of Cryptographic Modes of Operation +- Authors: D Chichester, W Du, R Kauffman, H Lin, C Lynch, A M. Marshall, C Meadows, P Narendran, V Ravishankar, L Rovira, *B Rozek*. +- Venue: International Symposium on Games, Automata, Logic, and Formal Verification, 2022. -[**Brandon Rozek**, Michael Giancola, Selmer Bringsjord, Naveen Sundar Govindarajulu. "A Representation-and-Reasoning Framework for Testimony-Infused Automated Adjudicative Dynamic Multi-agent Reasoning & Decision-making", International Conference on Robot Ethics and Standards, 2022.](https://www.clawar.org/icres2022/wp-content/uploads/2022/07/ICRES2022-Proceedings-manuscript.pdf#page=61) +[A Framework for Testimony-Infused Automated Adjudicative Dynamic +Multi-Agent Reasoning in Ethically Charged Scenarios](/paper/2207.01) +- Authors: *Brandon Rozek*, Michael Giancola, Selmer Bringsjord, Naveen Sundar Govindarajulu +- Venue: International Conference on Robot Ethics and Standards, 2022. +- [Paper](https://www.clawar.org/icres2022/wp-content/uploads/2022/07/ICRES2022-Proceedings-manuscript.pdf#page=61) -[Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, **Brandon Rozek**. "Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems", International Symposium on Frontiers of Combining Systems, 2021.](https://link.springer.com/chapter/10.1007/978-3-030-86205-3_14) +[Algorithmic Problems in the Symbolic Approach to the +Verification of Automatically Synthesized Cryptosystems ](/paper/2109.01) +- Authors: Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, *Brandon Rozek* +- Venue: International Symposium on Frontiers of Combining Systems, 2021. +- [Paper](https://link.springer.com/chapter/10.1007/978-3-030-86205-3_14) ## Papers -[D Chichester, W Du, R Kauffman, H Lin, C Lynch, A M. Marshall, C Meadows, P Narendran, V Ravishankar, L Rovira, **B Rozek**. "CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms", International Workshop on Rewriting Logic and its Applications, 2022.](http://sv.postech.ac.kr/wrla2022/assets/files/pre-proceedings-WRLA2022.pdf#page=12) - -[Andrew M Marshall, Catherine A Meadows, Paliath Narendran, Veena Ravishankar, **Brandon Rozek**. "Algorithmic Problems in Synthesized Cryptosystems", International Workshop on Unification, 2020.](https://www3.risc.jku.at/publications/download/risc_6129/proceedings-UNIF2020.pdf#page=58) +[CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms](/paper/2203.01) +- Authors: D Chichester, W Du, R Kauffman, H Lin, C Lynch, A M. Marshall, C Meadows, P Narendran, V Ravishankar, L Rovira, *B Rozek* +- Venue: International Workshop on Rewriting Logic and its Applications, 2022. +- [Paper](http://sv.postech.ac.kr/wrla2022/assets/files/pre-proceedings-WRLA2022.pdf#page=12) | [Slides](/files/slides/wrla2022-slides.pdf) +[Algorithmic Problems in Synthesized Cryptosystems](/paper/2006.01) +- Authors: Andrew M Marshall, Catherine A Meadows, Paliath Narendran, Veena Ravishankar, *Brandon Rozek* +- Venue: International Workshop on Unification, 2020. +- [Paper](https://www3.risc.jku.at/publications/download/risc_6129/proceedings-UNIF2020.pdf#page=58) ## Thesis @@ -28,19 +43,32 @@ D Chichester, W Du, R Kauffman, H Lin, C Lynch, A M. Marshall, C Meadows, P Nare ## Presentations -[D Chichester, W Du, R Kauffman, H Lin, C Lynch, A Marshall, C Meadows, P Narendran, V Ravishankar, L Rovira, **B Rozek**. "CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms", International Workshop on Rewriting Logic and its Applications, 2022.](/files/slides/wrla2022-slides.pdf) +QEP: The Quality Policy Evaluation Algorithm +- Venue: Research and Creativity Day at University of Mary Washington, 2019. +- [Program](/files/research/UMW-RC-2019.pdf#page=3) | [Slides](/files/research/QEP.pptx) -[Brandon Rozek. "QEP: The Quality Policy Evaluation Algorithm", Research and Creativity Day at University of Mary Washington, 2019.](/files/research/QEP.pptx) ([Program](/files/research/UMW-RC-2019.pdf#page=3)) -[**Brandon Rozek**, Stefano Coronado. "Beowulf Cluster for Research and Education", Research and Creativity Day at University of Mary Washington, 2018.](/files/research/LUNACposter.pdf) ([Program](/files/research/UMW-RC-2018.pdf#page=7)) +Beowulf Cluster for Research and Education +- Authors: *Brandon Rozek* and Stefano Coronado +- Venue: Research and Creativity Day at University of Mary Washington, 2018. +- [Program](/files/research/UMW-RC-2018.pdf#page=7) | [Poster](/files/research/LUNACposter.pdf) -[Brandon Rozek. "Coherent Control of Atomic Population Using the Genetic Algorithm", Summer Science Institute Research Symposium, 2017.](/files/research/coherentcontrolofatomicpopulation.pdf) +Coherent Control of Atomic Population Using the Genetic Algorithm +- Venue: Summer Science Institute Research Symposium, 2017. +- [Presentation](/files/research/coherentcontrolofatomicpopulation.pdf) -[Hannah Killian, **Brandon Rozek**. "Modelling Population Dynamics of Incoherent and Coherent Excitation", Virginia Academy of Science, 2017.](/files/research/modellingpopulationdynamics.pdf) ([Program](/files/research/VAS-Proceedings-95-2017.pdf#page=6)) -Hannah Killian, **Brandon Rozek**. “Modeling Population Dynamics of Incoherent and Coherent Excitation", Research and Creativity Day at University of Mary Washington, 2017. ([Program](/files/research/UMW-RC-2017.pdf#page=14)) +Modelling Population Dynamics of Incoherent and Coherent Excitation +- Authors: Hannah Killian and *Brandon Rozek* +- Venue: Virginia Academy of Science, 2017. +- [Poster](/files/research/modellingpopulationdynamics.pdf) | [Program](/files/research/VAS-Proceedings-95-2017.pdf#page=6) +Modeling Population Dynamics of Incoherent and Coherent Excitation +- Authors: Hannah Killian and *Brandon Rozek* +- Venue: Research and Creativity Day at University of Mary Washington, 2017. +- [Program](/files/research/UMW-RC-2017.pdf#page=14) + ## Awards [National Defense Science and Engineering Graduate (NDSEG) Fellowship, 2022-2025 (Tuition Support/$3400 per month stipend/$5000 Travel Fund/$1500 Personal Development Fund)](https://ndseg.org/2022-class-fellows) diff --git a/themes/pulp b/themes/pulp index 97d21d0..c8b013a 160000 --- a/themes/pulp +++ b/themes/pulp @@ -1 +1 @@ -Subproject commit 97d21d0722da87b7d05a6902e7aa0712c8774937 +Subproject commit c8b013a04b0ba46c593d4dcf06c4644d32ae279e