Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer

Autor: Couteau, Geoffroy, Roscoe, Bill, Ryan, Peter

Publikováno v: ACISP 2021-The 26th Australasian Conference on Information Security and Privacy
ACISP 2021-The 26th Australasian Conference on Information Security and Privacy, Dec 2021, Perth, Australia

International audience; We describe a new protocol to achieve two party ε-fair exchange: at any point in the unfolding of the protocol the difference in the probabilities of the parties having acquired the desired term is bounded by a value ε that

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1e75bff3c514a9184d0367906b34d015
https://hal.science/hal-03375287/file/2019-1281.pdf

Formal Methods : 22nd International Symposium, FM 2018, Held As Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 15-17, 2018, Proceedings. [elektronicky zdroj]

Autor: Havelund, Klaus

Externí odkaz: Kolekce e-knih KNAV (Registrovani uzivatele: plny text online 5 minut, dalsi pristup na vyzadani. Registered users: full text online 5 minutes, further access on requests.)

Information Leakage due to Revealing Randomly Selected Bits

Autor: Atashpendar, Arash, Roscoe, Bill, Ryan, Peter

Publikováno v: Security Protocols XXIII: Lecture Notes in Computer Science, Volume 9379, 2015 (pp. 325-341). Springer (2015).

This note describes an information theory problem that arose from some analysis of quantum key distribution protocols. The problem seems very natural and is very easy to state but has not to our knowledge been addressed before in the information theo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______2658::f8ec4d4e2f1f1890fd429d82231d10e3
http://orbilu.uni.lu/handle/10993/21251

Faster FDR Counterexample Generation Using SAT-Solving

Autor: Palikareva, Hristina, Ouaknine, Joel, Roscoe, Bill

With the flourishing development of efficient SAT-solvers, bounded model checking (BMC) has proven to be an extremely powerful symbolic model checking technique. In this paper, we address the problem of applying BMC to concurrent systems involving th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7a7849b94342d886ae159e617a052ed

Preface

Autor: Goldsmith, Michael, Roscoe, Bill

Publikováno v: Electronic Notes in Theoretical Computer Science. 250:1-2

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0463234b17c4b514d72e2c476b10f549
https://doi.org/10.1016/j.entcs.2009.08.001