Searching for authors named "Konstantinos Chatzikokolakis" – sorted by Relevance.
13 documents found, showing 1 through 10.
Next 10 →
-
A framework to analyze probabilistic protocols and its application to the partial secrets exchange
- …Abstract. We propose a probabilistic variant of the pi-calculus as a framework to specify randomized security protocols and their intended properties. In order to express an verify the correctness of the protocols, we develop a probabilistic version of the testing semantics. We then illustrate these…
- Cited by 9 (5 self) – Add To MetaCart
-
Making random choices invisible to the scheduler
- …Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to resolve the nondeterminism. It has been observed that for certain applications, notably those in security, the scheduler ne…
- Cited by 3 (3 self) – Add To MetaCart
-
Probability of error in information-hiding protocols
- …Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can be regarded as a hypothesis-testing problem. We consider the Bayesian approach to the problem, and investigate the probabi…
- Cited by 4 (4 self) – Add To MetaCart
-
Replace
- …this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be found at the ENTCS Macro Home Page. A monotonicity principle for information theory…
- Add To MetaCart
-
Construction and Repair: A Hybrid Approach to Search in CSPs
- …In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables are instantiated. If the current partial assignment is proved to be inconsistent, it is then necessary to backtrack and perform alte…
- Cited by 1 (0 self) – Add To MetaCart
-
Anonymity protocols as noisy channels
- …Abstract. We propose a framework in which anonymity protocols are interpreted as particular kinds of channels, and the degree of anonymity provided by the protocol as the converse of the channel’s capacity. We also investigate how the adversary can test the system to try to infer the user’s identity…
- Cited by 12 (5 self) – Add To MetaCart
-
Epistemic Strategies and Games on Concurrent Processes
- …Abstract. We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the interactions between agents and to control the information available to interacting agents. We define games and st…
- Add To MetaCart
-
Bisimulation for demonic schedulers
- …Abstract. Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the process and collaborates with the attacker can allow him to distinguish two processes even though they are bi…
- Add To MetaCart
-
Compositional Methods for Information-Hiding ⋆
- …Abstract. Protocols for information-hiding often use randomized primitives to obfuscate the link between the observables and the information to be protected. The degree of protection provided by a protocol can be expressed in terms of the probability of error associated to the inference of the secre…
- Add To MetaCart
-
Formal approaches to Information-Hiding – A tutorial ⋆ –
- …Abstract. In this survey paper we consider the class of protocols for informationhiding which use randomization to obfuscate the link between the observables and the information to be protected. We focus on the problem of formalizing the notion of information hiding, and verifying that a given proto…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
