Updated publications section to include paper entries and support for citation tags

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"
+---
+

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."
+---
+

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."
+---
+

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."
+---
+

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: ""
+---
+