Zobrazeno 1 - 10
of 1 103
pro vyhledávání: '"Roscoe, A. W."'
Smart contracts are the building blocks of the "code is law" paradigm: the smart contract's code indisputably describes how its assets are to be managed - once it is created, its code is typically immutable. Faulty smart contracts present the most si
Externí odkaz:
http://arxiv.org/abs/2205.07529
Autor:
Maffei, Ivo, Roscoe, A. W.
Delay Encryption (often called Timed-Release Encryption) is a scheme in which a message is sent into the future by ensuring its confidentiality only for a given amount of time. We propose a new scheme based on a novel time-lock puzzle. This puzzle re
Externí odkaz:
http://arxiv.org/abs/2205.05594
We develop the concept of Trusted and Confidential Program Analysis (TCPA) which enables program certification to be used where previously there was insufficient trust. Imagine a scenario where a producer may not be trusted to certify its own softwar
Externí odkaz:
http://arxiv.org/abs/2112.00346
Modern processors can offer hardware primitives that allow a process to run in isolation. These primitives implement a trusted execution environment (TEE) in which a program can run such that the integrity and confidentiality of its execution are gua
Externí odkaz:
http://arxiv.org/abs/2105.05962
Autor:
Antonino, Pedro, Roscoe, A. W.
The exploitation of smart-contract vulnerabilities can have catastrophic consequences such as the loss of millions of pounds worth of crypto assets. Formal verification can be a useful tool in identifying vulnerabilities and proving that they have be
Externí odkaz:
http://arxiv.org/abs/2002.02710
Autor:
Mestel, David, Roscoe, A. W.
Hoare's Communicating Sequential Processes (CSP) admits a rich universe of semantic models closely related to the van Glabbeek spectrum. In this paper we study finite observational models, of which at least six have been identified for CSP, namely tr
Externí odkaz:
http://arxiv.org/abs/1904.09875
From the output produced by a memoryless deletion channel from a uniformly random input of known length $n$, one obtains a posterior distribution on the channel input. The difference between the Shannon entropy of this distribution and that of the un
Externí odkaz:
http://arxiv.org/abs/1807.11609
Autor:
Atashpendar, Arash, Beunardeau, Marc, Connolly, Aisling, Géraud, Rémi, Mestel, David, Roscoe, A. W., Ryan, Peter Y. A.
A binary string transmitted via a memoryless i.i.d. deletion channel is received as a subsequence of the original input. From this, one obtains a posterior distribution on the channel input, corresponding to a set of candidate supersequences weighted
Externí odkaz:
http://arxiv.org/abs/1802.00703
Autor:
Roscoe, A. W.
The author has long enjoyed using the CSP refinement checker FDR to solve puzzles, as witnessed by examples in \cite{tpc,ucs}. Recent experiments have shown that a number of games of patience (card games for one) are now well within bounds. We discus
Externí odkaz:
http://arxiv.org/abs/1611.08418
Autor:
ERDSIEK
Publikováno v:
Deutsche Rechts-Zeitschrift, 1950 Jan . 5(2), 47-47.
Externí odkaz:
https://www.jstor.org/stable/20810484
