Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
- In contrast to most of the senior level Artificial Intelligence (AI) courses where AI is taught in the jargon of theoretical computer science with crowd of complex matrix algebra...
Zhiguang Xu, Chris Neasbitt, Jared Summers, Bill C...
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...