Filters








235,045 Hits in 3.7 sec

A Theory of Protocol Composition [article]

Laura Bocchi, Dominic Orchard, Laura Voinea
2022 arXiv   pre-print
Composition is considered for implementations of a protocol, but not for the protocols themselves as engineering components.  ...  Our notion of composition defines an interleaving of two or more protocols in a way that satisfies user-specified context-dependent constraints which serve to explain "contact points" between the protocols  ...  For simplicity of presentation, we limit the theory to the composition S 1 || S 2 of two protocols S 1 and S 2 .  ... 
arXiv:2203.02461v1 fatcat:v27dlduygbeizcbonjfujrospi

On the Way to a Theory for Network Architectures [chapter]

Thi-Mai-Trang Nguyen
2010 IFIP Advances in Information and Communication Technology  
In order to analyze the architecture of the Internet in a strict manner, it is necessary to understand in depth the composition of functionalities within a protocol or between protocols.  ...  This paper presents a study on the composition of network functionalities and highlights future directions towards a theory for network architectures which includes the principles that network architectures  ...  Section 6 discusses the possibilities to integrate the functionality composition principles into existing communication theory for a theory of network architecture.  ... 
doi:10.1007/978-3-642-15476-8_12 fatcat:ykrw343njvfg3okm2bdcsn23vy

A Strict-Observational Interface Theory for Analysing Service Orchestrations

Philip Mayer, Andreas Schroeder, Sebastian S. Bauer
2010 Electronical Notes in Theoretical Computer Science  
Based on a practical example, we motivate and introduce new notions of refinement and compatibility, and prove that they constitute a valid interface theory.  ...  In this paper, we discuss application-level protocol compliance checking of service orchestrations and service protocols using the semantic domain of modal input/output automata (MIOs).  ...  Acknowledgement This research has been partially supported by the GLOWA-Danube project 01LW0602A2 sponsored by the German Federal Ministry of Education and Research, and the EC project Sensoria, IST-2005  ... 
doi:10.1016/j.entcs.2010.07.009 fatcat:nhd7t4u7m5ajvaaktsqlqc2yja

Effective Sequential Protocol Composition in Maude-NPA [article]

Sonia Santiago and Santiago Escobar and Catherine Meadows and José Meseguer
2016 arXiv   pre-print
We also provide an experimental analysis of the performance of Maude-NPA using the compositional syntax and semantics, and compare it to the performance of a syntax and semantics for composition developed  ...  Many of the problems in cryptographic protocols arise when such composition is done incorrectly or is not well understood.  ...  Of more interest to us is the research that addresses the compositionality of the protocol properties themselves, called additive composition in [10] .  ... 
arXiv:1603.00087v1 fatcat:jvc3ph62erbarbiyoqn4hdynzi

Nonlocality without entanglement: Quantum theory and beyond

Some Sankar Bhattacharya, Sutapa Saha, Tamal Guha, Manik Banik
2020 Physical Review Research  
We propose a framework to compare the strength of NWE in different theories and show that such behavior in quantum theory is limited, suggesting a specific topological feature of quantum theory, namely  ...  In this Rapid Communication we show that the phenomena of NWE is not specific to quantum theory only, but rather a class of generalized probabilistic theories that can exhibit such behavior.  ...  Given two systems S ys (A) ≡ ( A , E A ) and S ys (B) ≡ ( B , E B ) the theory also delineates their composition.  ... 
doi:10.1103/physrevresearch.2.012068 fatcat:g7fvaf2tqfgbjnspvkijmbeaai

Ordered linear spaces and categories as frameworks for information-processing characterizations of quantum and classical theory [article]

Howard Barnum, Alexander Wilce
2009 arXiv   pre-print
As an example, a set of states in such a theory is broadcastable if, and only if, it is contained in a simplex whose vertices are cloneable, and therefore distinguishable by a single measurement.  ...  processing and other aspects of theories formulated categorically.  ...  We say a composite ABA supports a conclusive teleportation protocol if such a protocol (f, ω) exists with f, ω allowed states and effects of the composite.  ... 
arXiv:0908.2354v1 fatcat:lrjeapxupvgj3d2vylbgd4xsyi

On Adversary Models and Compositional Security

Anupam Datta, Jason Franklin, Deepak Garg, Limin Jia, Dilsun Kaynar
2011 IEEE Security and Privacy  
We describe logic-based methods to reason about security properties of a system as a composition of properties of its components, and several successful applications of the method in explaining and predicting  ...  attacks in a wide-variety of systems.  ...  Our theory builds on and generalizes prior work on a compositional theory for the domain of cryptographic protocols [4] and is influenced by compositional reasoning principles for functional correctness  ... 
doi:10.1109/msp.2010.203 fatcat:ailuix65hfhhlk65daqyhcdxve

Nonlocality Without Entanglement: Quantum Theory and Beyond [article]

Some Sankar Bhattacharya, Sutapa Saha, Tamal Guha, Manik Banik
2019 arXiv   pre-print
We propose a framework to compare the strength of NWE in different theories and show that such behavior in quantum theory is limited, suggesting a specific topological feature of quantum theory, namely  ...  Here we show that the phenomena of NWE is not specific to quantum theory only, rather a class of generalized probabilistic theories can exhibit such behavior.  ...  Quantum theory: (a) If Alice follows a protocol as of Fig 4, 5) .  ... 
arXiv:1908.10676v1 fatcat:kirgnuwklrfktlvdapk5hr6iym

Composition of Password-Based Protocols

Stéphanie Delaune, Steve Kremer, Mark Ryan
2008 2008 21st IEEE Computer Security Foundations Symposium  
We investigate the composition of protocols that share a common secret. This situation arises when users employ the same password on different services.  ...  We show that resistance against guessing attacks composes in the presence of a passive attacker. However, composition does not preserve resistance against guessing attacks for an active attacker.  ...  Conclusion We investigated the composition of protocols that share a common secret, and answered the question of whether such composition preserves resistance to guessing attacks.  ... 
doi:10.1109/csf.2008.6 dblp:conf/csfw/DelauneKR08 fatcat:ud6oqdk3ozf6valt7qnwdhzijm

Bit Commitment in Operational Probabilistic Theories [article]

Lorenzo Giannelli
2021 arXiv   pre-print
In particular a careful study is carried on the feasibility of bit commitment in the non-local boxes theory. New aspects of the theory are also presented.  ...  The aim of this thesis project is to investigate the bit commitment protocol in the framework of operational probabilistic theories.  ...  The authors found that Alice probability of successfully cheating is at maximum equal to 1/2 but can be asymptotically reduced if the protocol is repeated times.  ... 
arXiv:2101.09171v1 fatcat:xdaa6dbgqbe2zc23ohhdggvmsy

Towards a Protocol Algebra Based on Algebraic Specifications [chapter]

Iakovos Ouranos, Petros Stefaneas
2014 Studies in Computational Intelligence  
We sketch some first steps towards the definition of a protocol algebra based on the framework of behavioural algebraic specification.  ...  The proposed protocol algebra is inspired by the module algebra and the hierarchical object composition technique.  ...  A. Protocol Sum Since we specify protocols as behavioural objects, the protocol sum corresponds to the sum of the corresponding behavioural theories.  ... 
doi:10.1007/978-3-319-00948-3_6 fatcat:2xwcxryhlncxpcqeosievtnxu4

A Theory of Networking and Its Contributions to Software Engineering [chapter]

Pamela Zave
2017 Present and Ulterior Software Engineering  
This paper presents a compositional theory of networking as an example of a useful and realistic domain theory.  ...  Next, the theory is extended with composition of network domains, which is directly relevant to solving today's most critical networking problems.  ...  Acknowledgements This paper is based on the results of long-term collaborations with Michael Jackson and Jennifer Rexford.  ... 
doi:10.1007/978-3-319-67425-4_4 fatcat:ctmumqekivha3lcmurx6cvt6hy

A Mathematical Model of Dialog

Mark W. Johnson, Peter McBurney, Simon Parsons
2005 Electronical Notes in Theoretical Computer Science  
Despite this effort, no formal mathematical theory of agent interaction languages and protocols yet exists.  ...  We argue that such a theory needs to account for the semantics of agent interaction, and propose the first mathematical theory which does this.  ...  Such a theory is the aim of our work. This paper presents the first mathematical theory of agent interaction protocols, comprising a categorical semantics for a very broad class of protocols.  ... 
doi:10.1016/j.entcs.2005.05.015 fatcat:5ohpr63gorhc7meg6svs5dig6u

Protocol Modeling with Model Program Composition [chapter]

Margus Veanes, Wolfram Schulte
2008 Lecture Notes in Computer Science  
The overall behavior of a protocol can be defined by a composite model program, which defines how the individual parts interoperate.  ...  To fight this increasing complexity problem, we introduce a methodology and formal framework that uses model program composition to specify behavior of such protocols.  ...  A protocol typically has many different facets. Each facet provides a partial view of the overall functionality of the protocol with a coherent purpose.  ... 
doi:10.1007/978-3-540-68855-6_21 fatcat:ovl3k4aclzdvraacmvopwrqeci

Categorical composable cryptography: extended version [article]

Anne Broadbent, Martti Karvonen
2022 arXiv   pre-print
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  ...  On the way, we exhibit two categorical constructions of resource theories that might be of independent interest: one capturing resources shared among multiple parties and one capturing resource conversions  ...  For instance, in the algebraic theory of systems of [MMP + 18] the parallel composition is a partial operation and in particular the parallel composite of a system with itself is never defined 1 and the  ... 
arXiv:2208.13232v1 fatcat:fvf5hikn7jd7dk4qrlsbxgzk5q
« Previous Showing results 1 — 15 out of 235,045 results