Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
Ajith Ramanathan, John C. Mitchell, Andre Scedrov,...
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...