Blockchain Papers

Luisa Scarcella

No abstract is available for this record.

Vincenzo Mario Bruno Giorgino

No abstract is available for this record.

Adrian Jackson, Ashley Lloyd, Justin Macinante, Markus Hüwener

No abstract is available for this record.

Mark Fenwick, Wulf A. Kaal, Erik P. M. Vermeulen

No abstract is available for this record.

Weiß Jan-Patrick, Tobias Welzel, Bernd J. Hartmann, Hübner Ursula · 5 authors

BACKGROUND: Diabetes mellitus is one of the most prominent examples of chronic conditions that requires an active patient self-management and a network of specialists. OBJECTIVES: The aim of this study was to analyze the user and legal requirements and develop a rough technology concept for a secure and patient-centered exchange platform. METHODS: To this end, 14 experts representing different stakeholders were interviewed and took part in group discussions at three workshops, the pertinent literature and legal texts were analyzed. RESULTS: The user requirements embraced a comprehensive set of use cases and the demand for "one platform for all" which is underlined by the right for data portability according to new regulations. In order to meet these requirements a distributed ledger technology was proposed. CONCLUSION: We will therefore focus on a patient-centered application that showcases self-management and exchange with health specialists.

Robert Anascavage, Nathan Davis

No abstract is available for this record.

Yuan Zhang, Xiaodong Lin, Chunxiang Xu

No abstract is available for this record.

Debajani Mohanty

So far we have discussed the Ethereum architecture, Solidity programming, and the Ethereum client, including setting it up and compiling, running, and debugging Dapps. That’s a lot of work, isn’t it? In this chapter, let’s discuss two leading frameworks, Truffle and Embark, that will provide a set of tools and boilerplate code for scaffolding Dapps for Ethereum. The frameworks will do much of the work themselves and leave you with only a few tasks.

Emanuele Borgonovo, Alessandra Cillo, Stefano Caselli, Donato Masciandaro

No abstract is available for this record.

Wawrzyniec Michalczyk

Streszczenie: Artyku powicony jest tematyce bitcoina, prekursora wrd kryptowalut i wci najwaniejszej z nich. Na drodze do coraz szerszego wykorzystania go jako nowej formy pienidza midzynarodowego stoi wiele barier. Celem opracowania jest identyfikacja i charakterystyka najistotniejszych z nich: stabilizacji kursu, odpowiedniego zakresu i jakoci regulacji na poziomie pastwowym i midzynarodowym, zwikszenia stopnia bezpieczestwa systemu oraz koniecznoci upowszechnienia si bitcoina

Christian Fries, Peter Kohl-Landgraf

No abstract is available for this record.

Naif Alzahrani, Nirupama Bulusu

No abstract is available for this record.

Mahdi Zamani, Mahnush Movahedi, Mariana Raykova

No abstract is available for this record.

Pelin Angın, Melih Burak Mert, Okan Mete, Azer Ramazanli · 6 authors

No abstract is available for this record.

Damian Gruber, Wenting Li, Ghassan Karame

Lightweight clients are gaining increasing adoption in existing blockchain deployments, owing to their reduced resource consumption. There are currently a number of libraries that implement lightweight clients (e.g., BIP37, Electrum, LES, filter commitments). Notice that these libraries are intrinsically different and require significant effort to be integrated across blockchain platforms. Additionally, lightweight clients require the cooperation of full nodes, which are expected to invest in their computational (to run filters) and bandwidth resources in order to serve lightweight clients. Existing blockchains however offer no rewards for full nodes in exchange-which offers little incentives for full nodes to correctly serve lightweight clients.

Yu xin Song, Zhong xia Liao, Yan hua Liang

Trusted computing is principle measure to ensure the security of computing platform, which improves the creditability by functions including data protection, identity authentication, integrity measurement, storage and reports. In order to easily provide architecture for security authentication of terminal members, and to protect the user's privacy and secret data, this article studies the remote identification for TPM. It introduces DAA anonymous authentication technology to traditional PKI and adopts improved DAA scheme to provide trusted identity authentication, secure channel establishment and sub-certificate update operation. We propose a new model for identity authentication under trusted computing environment. The scheme constructs a safe elliptic hyperbola by ISSUER and generate DAA certificate, which awards zero knowledge proof to each platform to achieve DAA certificate respectively. Then the code service provided by OPENSSL is used to establish PCA and simulated the AIK certificate process according to creation of AIK certificate. Finally, the experiments are performed under VMware-workstation and SUSE virtual machines, with TPM Emulator and TPM chips simulation, to verify the feasibility of remote user trustworthiness authentication scheme. The remote authentication scheme focused by this article is a protocol with anonymity, authentication and security, which will be useful and applicable in current information society.

Chris Berg

No abstract is available for this record.

John Paul Cook

No abstract is available for this record.

Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett

Non-malleable codes provide a useful and meaningful security guarantee in situations where traditional error-correction (and even error-detection) is impossible, for example, when the attacker can completely overwrite the encoded message. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message or a completely unrelated value. Although such codes do not exist if the family of “tampering functions” ${\mathcal F}$ is completely unrestricted, they are known to exist for many broad tampering families ${\mathcal F}$. One such natural family is the family of tampering functions in the so-called split-state model. Here the message $m$ is encoded into two shares $L$ and $R$, and the attacker is allowed to arbitrarily tamper with $L$ and $R$ individually. The split-state tampering arises in many realistic applications, such as the design of non-malleable secret sharing schemes, motivating the question of designing efficient non-malleable codes in this model. Prior to this work, non-malleable codes in the split-state model received considerable attention in the literature but either (1) were constructed in the random oracle model, or (2) relied on advanced cryptographic assumptions (such as noninteractive zero-knowledge proofs and leakage-resilient encryption), or (3) could only encode 1-bit messages. As our main result, we build the first efficient, multi-bit, information-theoretically-secure non-malleable code in the split-state model. The heart of our construction uses the following new property of the inner-product function $\langle{L,R\rangle}$ over the vector space ${{F}_p}^n$ (for a prime $p$ and large enough dimension $n$): if $L$ and $R$ are uniformly random over ${\mathbb{F}_p}^n$, and $f,g:{\mathbb{F}_p}^n\rightarrow {\mathbb{F}_p}^n$ are two arbitrary functions on $L$ and $R$, then the joint distribution $(\langle{L,R\rangle},\langle{f(L),g(R)\rangle})$ is “close” to the convex combination of “affine distributions” $\{(U,aU+b)\mid a,b\in \mathbb{F}_p\}$, where $U$ is uniformly random in ${\mathbb{F}_p}$. In turn, the proof of this surprising property of the inner product function critically relies on some results from additive combinatorics, including the so-called quasi-polynomial Freiman--Ruzsa theorem, which was recently established by Sanders [Anal. PDE, 5 (2012), pp. 627--655] as a step toward resolving the polynomial Freiman--Ruzsa conjecture [B. Green, in Surveys in Combinatorics, London Mathematical Society, London, 2005, pp. 1--29].

Weijin Wang, Jingbin Liu, Yu Qin, Dengguo Feng

No abstract is available for this record.

Pietro Marchionni

No abstract is available for this record.

Jorge Martínez-Vázquez, Cristian F. Sepúlveda

No abstract is available for this record.

Gerald W. Fry

No abstract is available for this record.

Xigao Wu, Bin Duan, Ying Zhong, Yinxin Yan · 5 authors

No abstract is available for this record.