Cosmic Security [article]

Benjamin Chan, Cody Freitag, Rafael Pass
2022 IACR Cryptology ePrint Archive  
We define a framework for analyzing the security of cryptographic protocols that makes minimal assumptions about what a "realistic model of computation is". In particular, whereas classical models assume that the attacker is a (perhaps non-uniform) probabilistic polynomialtime algorithm, and more recent definitional approaches also consider quantum polynomialtime algorithms, we consider an approach that is more agnostic to what computational model is physically realizable. Our notion of cosmic
more » ... ecurity considers a reduction-based notion of security that models attackers as arbitrary unbounded stateful algorithms; we also consider a more relaxed notion of cosmic security w.r.t. weakly-restartable adversaries which makes additional restrictions on the attacker's behavior. We present both impossibility results and general feasibility results for our notions, indicating that extended Church-Turing hypotheses may not be needed for a well-founded theory of Cryptography.
dblp:journals/iacr/ChanFP22 fatcat:s7n54vb5jjcttiyej27cxgizfy