Filters








98,468 Hits in 3.9 sec

Probabilistic conformance testing of protocols with unobservable transitions

S.H. Low
1993 International Conference on Network Protocols  
W e propose a probabilistic approach to conformance testing of protocols containing unobservable transitions.  ...  The conventional testing of protocols without unobservable transitaons uses mismatch in outputs to detect faults.  ...  We propose a probabilistic approach to conformance testing of such protocols.  ... 
doi:10.1109/icnp.1993.340890 dblp:conf/icnp/Low93 fatcat:ow2uv6kp4resfi6r75ysgjb5o4

A framework for analyzing probabilistic protocols and its application to the Partial Secrets Exchange

Konstantinos Chatzikokolakis, Catuscia Palamidessi
2007 Theoretical Computer Science  
In order to express and verify the correctness of the protocols, we develop a probabilistic version of the testing semantics.  ...  We propose a probabilistic variant of the pi-calculus as a framework to specify randomized security protocols and their intended properties.  ...  We present its semantics and propose a notion of probabilistic testing preorder.  ... 
doi:10.1016/j.tcs.2007.09.006 fatcat:ef2vgl543babxkg53gshm453ai

A Framework for Analyzing Probabilistic Protocols and Its Application to the Partial Secrets Exchange [chapter]

Konstantinos Chatzikokolakis, Catuscia Palamidessi
2005 Lecture Notes in Computer Science  
In order to express an verify the correctness of the protocols, we develop a probabilistic version of the testing semantics.  ...  We propose a probabilistic variant of the pi-calculus as a framework to specify randomized security protocols and their intended properties.  ...  We present its semantics and propose a notion of probabilistic testing preorder.  ... 
doi:10.1007/11580850_9 fatcat:2rzc3c4o65glnms2shuw2isgia

Inferring Protocol State Machine from Network Traces: A Probabilistic Approach [chapter]

Yipeng Wang, Zhibin Zhang, Danfeng Yao, Buyun Qu, Li Guo
2011 Lecture Notes in Computer Science  
We also formally define a new model -probabilistic protocol state machine (P-PSM), which is a probabilistic generalization of protocol state machine.  ...  In our experiments, we evaluate a text-based protocol and two binary-based protocols to test the performance of Veritas.  ...  Fig. 7 . 7 Probabilistic protocol state machine of PPLIVE protocol. Fig. 8 . 8 Probabilistic protocol state machine of XUNLEI protocol.  ... 
doi:10.1007/978-3-642-21554-4_1 fatcat:vi7wthplofhsdazd2edmh56lwa

Generating Probabilistic and Intensity-Varying Workload for Web-Based Software Systems [chapter]

André van Hoorn, Matthias Rohr, Wilhelm Hasselbring
2008 Lecture Notes in Computer Science  
An application model specifies the possible interactions with the Web-based software system, as well as all required low-level protocol details by means of a hierarchical finite state machine.  ...  Based on the application model, the probabilistic usage is specified in corresponding user behavior models by means of Markov chains.  ...  Probabilistic Test Plan and configuration dialog of the Markov Session Controller including the definition of the user behavior mix.  ... 
doi:10.1007/978-3-540-69814-2_9 fatcat:ktfsxwhiqzcu7jv2kd6hy4wram

Probabilistic Communication Complexity Over The Reals

Dima Grigoriev
2008 Computational Complexity  
Abstract Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting).  ...  A polyhedron and a union of hyperplanes are constructed in R 2n for which a lower bound n/2 on the probabilistic communication complexity of recognizing each is proved.  ...  Mathematik, Bonn where the paper was written, to Farid Ablayev and to Harry Buhrman for interesting discussions and to anonymous referees for very detailed comments, which helped to improve the presentation of  ... 
doi:10.1007/s00037-008-0255-z fatcat:afconvyyebg23byu2ou2v7w2mu

Probabilistic communication complexity over the reals [article]

Dima Grigoriev
2007 arXiv   pre-print
Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting).  ...  A polyhedron and a union of hyperplanes are constructed in ^2n for which a lower bound n/2 on the probabilistic communication complexity of recognizing each is proved.  ...  Mathematik, Bonn where the paper was written, to Farid Ablayev and to Harry Buhrman for interesting discussions and to anonymous referees for very detailed comments, which helped to improve the presentation of  ... 
arXiv:0710.2732v1 fatcat:dy3wybsxcbhp7my5ssmrf6i45q

Using Probabilistic Kleene Algebra for Protocol Verification [chapter]

A. K. McIver, E. Cohen, C. C. Morgan
2006 Lecture Notes in Computer Science  
We propose a method for verification of probabilistic distributed systems in which a variation of Kozen's Kleene Algebra with Tests [11] is used to take account of the well-known interaction of probability  ...  We describe pKA, a probabilistic Kleene-style algebra, based on a widely accepted model of probabilistic/demonic computation [7, 25, 17] .  ...  to probabilistic protocol verification.  ... 
doi:10.1007/11828563_20 fatcat:nlh7zni2bzgtnaws4uuoze6nve

Secure and Efficient Delegation of Elliptic-Curve Pairing [chapter]

Giovanni Di Crescenzo, Matluba Khodjaeva, Delaram Kahrobaei, Vladimir Shpilrain
2020 Lecture Notes in Computer Science  
Important requirements for such delegation protocols include privacy of the client's pairing inputs and security of the client's output, in the sense of detecting, except for very small probability, any  ...  The client's online runtime improvement is, for some of our protocols almost 1 order of magnitude, no matter which practical elliptic curve, among recently recommended ones, is used for the pairing realization  ...  (Membership Test:) C checks that w 0 ∈ G T (Probabilistic Test:) C checks that w 1 = w b 0 · v 1 If any of these tests fails then C returns ⊥ and the protocol halts C returns y = w 0 Protocol Properties  ... 
doi:10.1007/978-3-030-57808-4_3 fatcat:jiqv5heanrfo7fdz4tx3vxjhbe

Using probabilistic Kleene algebra pKA for protocol verification

A.K. McIver, C. Gonzalia, E. Cohen, C.C. Morgan
2008 The Journal of Logic and Algebraic Programming  
We propose a method for verification of probabilistic distributed systems in which a variation of Kozen's Kleene Algebra with Tests [Dexter Kozen, Kleene algebra with tests, ACM Trans.  ...  We describe pKA, a probabilistic Kleene-style algebra, based on a widely accepted model of probabilistic/demonic computation [Jifeng He, K. Seidel, A.K.  ...  of probabilistic distributed protocols within range of full automation after all.  ... 
doi:10.1016/j.jlap.2007.10.005 fatcat:nuuhuzvb3bgrlcqykiw7opbw7a

Model-Based Testing of Probabilistic Systems [chapter]

Marcus Gerhold, Mariëlle Stoelinga
2016 Lecture Notes in Computer Science  
This paper presents a model-based testing framework for probabilistic systems. We provide algorithms to generate, execute and evaluate test cases from a probabilistic requirements model.  ...  Key results of our paper are the classical soundness and completeness properties, establishing the mathematical correctness of our framework; Soundness states that each test case is assigned the right  ...  A sample of the protocol is shown in Table 1 . Note that our specication of this protocol contains no non-determinism.  ... 
doi:10.1007/978-3-662-49665-7_15 fatcat:5fzbcidnwzekdmnzbuijvgd3iq

Scalable Deniable Group Key Establishment [chapter]

Kashi Neupane, Rainer Steinwandt, Adriana Suárez Corona
2013 Lecture Notes in Computer Science  
The popular Katz-Yung compiler from CRYPTO 2003 can be used to transform unauthenticated group key establishment protocols into authenticated ones.  ...  In this paper we present a modification of Katz and Yung's construction which maintains the round complexity of their compiler, but for 'typical' unauthenticated group key establishments adds authentication  ...  We prove the security of the protocol by 'game hopping', letting the probabilistic polynomial time adversary A of the compiled protocol P' interact with a simulator S.  ... 
doi:10.1007/978-3-642-37119-6_24 fatcat:rqwvnrxnpzdjriotpeyh5pjhqy

Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems

P.R. D'Argenio, J.C.M. Baeten
2003 The Journal of Logic and Algebraic Programming  
In recent years, we have seen much progress in the specification, modeling and analysis of probabilistic behaviour.  ...  Nevertheless, a bounded retransmission protocol would never satisfy this property since, after a bounded number of attempts, transmission is aborted.  ...  Finally, Manuel Nuñez's article presents a testing theory of Hennessy-Milner for fully probabilistic systems.  ... 
doi:10.1016/s1567-8326(02)00064-4 fatcat:54tmit7fbjdbjngagab2wulsge

Statistical Analysis of Privacy and Anonymity Guarantees in Randomized Security Protocol Implementations [article]

Susmit Jha
2009 arXiv   pre-print
In order to evaluate the accuracy of our statistical approach, we compare our technique with the probabilistic model checking technique on two examples: crowds protocol and dining crypotgrapher's protocol  ...  Security protocols often use randomization to achieve probabilistic non-determinism. This non-determinism, in turn, is used in obfuscating the dependence of observable values on secret data.  ...  I am thankful to Martin Wainwright for insightful suggestions about use of statistical techniques. I am also thankful to Sanjit Seshia for fruitful discussions.  ... 
arXiv:0906.5110v1 fatcat:pwtnxrom7bgurmyfbsh6s32f4u

Formal analysis techniques for gossiping protocols

Rena Bakhshi, Francois Bonnet, Wan Fokkink, Boudewijn Haverkort
2007 ACM SIGOPS Operating Systems Review  
We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them.  ...  We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner.  ...  In so-called statistical probabilistic methods (e.g., [74] ), statistical hypothesis testing is used instead of randomized approximation schemes.  ... 
doi:10.1145/1317379.1317385 fatcat:ppg5garcsrbr3b7ugdijxvs3mu
« Previous Showing results 1 — 15 out of 98,468 results