Concurrent Quantum Strategies

Clairambault, Pierre; Visme, Marc de; Winskel, Glynn

doi:10.1007/978-3-030-21500-2_1

Cited by 4 publications

(10 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, many existing approaches to composable cryptography develop their own models of concurrent, asynchronous, probabilistic and interactive computations. As categorical models of such computation exist in the context of game semantics [21,22,80], one is left wondering whether the models of the semanticists' could be used to study and answer cryptographic questions, or conversely if the models developed by cryptographers contain valuable insights for programming language semantics.…”

Section: Discussionmentioning

confidence: 99%

“…As category theory is de facto the lingua franca between several subfields of mathematics and computer science, elucidating the categorical structures present in cryptography opens up the door to further connections between cryptography and other fields. For instance, game semantics readily gives models of interactive, asynchronous and probabilistic (or quantum) computation [21,22,80] in which our theory can be instantiated, and thus further paves the way for programming language theory to inform cryptographic models of concurrency.…”

Section: Related Workmentioning

confidence: 99%

“…Except that in their framework the 2-party case seems to require security constraints also when both parties cheat.5 We do not view this as overtly restrictive, as many theoretical models of concurrent interactive (probabilistic/quantum) computation are compact closed[21,22, 80].…”

mentioning

confidence: 99%

See 2 more Smart Citations

Categorical composable cryptography

Broadbent,

Karvonen

2021

Preprint

View full text Add to dashboard Cite

We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract model of composable security definitions in cryptography. Our model is able to incorporate computational security, set-up assumptions and various attack models such as colluding or independently acting subsets of adversaries in a modular, flexible fashion. We conclude by using string diagrams to rederive no-go results concerning the limits of bipartite and tripartite cryptography, ruling out e.g. composable commitments and broadcasting. On the way, we exhibit two categorical constructions of resource theories that might be of independent interest: one capturing resources shared among n parties and one capturing resource conversions that succeed asymptotically.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Categorical composable cryptography

Broadbent,

Karvonen

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…As category theory is de facto the lingua franca between several subfields of mathematics and computer science, elucidating the categorical structures present in cryptography opens up the door to further connections between cryptography and other fields. For instance, game semantics readily gives models of interactive, asynchronous and probabilistic (or quantum) computation [18,19,69] in which our theory can be instantiated, and thus further paves the way for programming language theory to inform cryptographic models of concurrency.…”

Section: Related Workmentioning

confidence: 99%

Categorical composable cryptography

Broadbent

Karvonen

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract model of composable security definitions in cryptography. Our model is able to incorporate computational security, set-up assumptions and various attack models such as colluding or independently acting subsets of adversaries in a modular, flexible fashion. We conclude by using string diagrams to rederive the security of the one-time pad and no-go results concerning the limits of bipartite and tripartite cryptography, ruling out e.g., composable commitments and broadcasting.

show abstract

“…This has been sprung from [21,28], in which the authors confirm that only irreversible computations need to consume energy; therefore, reversible computation is favorable in low-energy computing. In the literature, there are a surprising number of reversible computation studies that have emerged for modeling systems that are naturally reversible, such as biological system [9,15,40], chemical systems [9,42], and quantum computations [1,10]. Reversibility has also been used in transactions systems [14,29] and in debugging systems [26,32,33], without forgetting space exploration problems [11,17,27,29].…”

Section: Introductionmentioning

confidence: 99%

Causal Reversibility in Individual Token Interpretation of Petri Nets

Benamira

2020

csci

View full text Add to dashboard Cite

Causal reversibility in concurrent systems means that events that the origin of other events can only be undone after undoing of its consequences. In opposite to backtracking, the events which are independent of each other can be reversed in an arbitrary order, in the other words, we have flexible reversibility w.r.t the causality relation. An implementation of Individual token interpretation ofPetri Nets (IPNs) was been proposed by Rob Van Glabbeek et al, the present paper investigates into a study of causal reversibility within IPNs. Given N be an IPN, by adding an intuitive firing rule to undo transitions according to the causality relation, the coherence of N is assured, i.e., the set of all reachable states of N in the reversible version and that of the original one are identical. Furthermore, reversibility in N is flexible and their initial state can be accessible in reverse from any state. In this paper an approach for controllingcausal-reversibility within IPNs is proposed.

show abstract

Concurrent Quantum Strategies

Cited by 4 publications

References 16 publications

Categorical composable cryptography

Categorical composable cryptography

Categorical composable cryptography

Causal Reversibility in Individual Token Interpretation of Petri Nets

Contact Info

Product

Resources

About