Christoph Egger, Mike Graf, Ralf Küsters, Daniel Rausch · 6 authors
In the past few years blockchains have been a major focus for security research, resulting in significant progress in the design, formalization, and analysis of blockchain protocols. However, the more general class of distributed ledgers, which includes not just blockchains but also prominent non-blockchain protocols, such as Corda and OmniLedger, cannot be covered by the state-of-the-art in the security literature yet. These distributed ledgers often break with traditional blockchain paradigms, such as block structures to store data, system-wide consensus, or global consistency. In this paper, we close this gap by proposing the first framework for defining and analyzing the security of general distributed ledgers, with an ideal distributed ledger functionality, called Fledger, at the core of our contribution. This functionality covers not only classical blockchains but also non-blockchain distributed ledgers in a unified way. To illustrate Fledger, we first show that the prominent ideal block-chain functionalities Gledger and GPL realize (suitable instantiations of) Fledger, which captures their security properties. This implies that their respective implementations, including Bitcoin, Ouroboros Genesis, and Ouroboros Crypsinous, realize Fledger as well. Secondly, we demonstrate that Fledger is capable of precisely modeling also non-blockchain distributed ledgers by performing the first formal security analysis of such a distributed ledger, namely the prominent Corda protocol. Due to the wide spread use of Corda in industry, in particular the financial sector, this analysis is of independent interest. These results also illustrate that Fledger not just generalizes the modular treatment of blockchains to distributed ledgers, but moreover helps to unify existing results.
The quick jumps in developing new digital identity technologies have resulted in this trend of developing privacy-preserving solutions in Know Your Customer (KYC) verification systems. This article delves into the evolution of an Advanced Digital Identity Orchestration Engine to enhance privacy protection in the KYC processes. With the rise of concerns surrounding data privacy and security, traditional knowledge of customer systems which are based on centralized database, have faced major challenges including data breaches and unauthorized access. In contrast, the proposed identity orchestration engine draws on the use of Self-Sovereign Identity (SSI) principles, blockchain technology, and verifiable credentials to offer a decentralized, secure and privacy-preserving solution to identity management problem. This engine allows users to manage their personal identity information, and selectively share their information with entities they trust without losing their privacy. By leveraging decentralized identifiers (DIDs) and public key cryptography, the system is enabled to ensure the sensitive data isn't kept in a central place causing reduction in the odds of unauthorized access. Furthermore, features such as zero knowledge proofs (ZKPs) and selective disclosure provide the option for a granular control on what data is shared to ensure that only the required information is provided to comply with regulation requirements. This article also talks about integrating the orchestration engine with existing frameworks for KYC and explores the scalability, interoperability, and potential for this engine to help increase inclusivity in digital identity management. Through case studies and real-world examples, the paper points out the efficiency in working of this engine in getting better security and privacy and user experience in the process of KYC verification. Ultimately, the solution proposed creates a major step forward to privacy-preserving and user-centric digital Identity systems adapted both globally to regulatory requirements and to increase trust in digital financial services.
Andreas Abraham, Stefan More, Christof Rabensteiner, Felix Hörandner
Identity management systems enable users (i.e., provers) to authenticate and provide attributes to verifiers by using certified credentials obtained from an authority. To accept such a credential, verifiers require information on whether the presented credentials are still valid or if they have been revoked. Up-to-date revocation information can be obtained from a revocation database; however, this requires that the verifier or prover is online. The problem becomes more interesting in the offline case when the prover (e.g., citizen) and verifier (e.g., police officer) do not have an Internet connection to query the revocation status of the presented credential (e.g., digital driver's license). In this paper, we extend the Self-Sovereign Identity (SSI) model to support both revocation as well as offline-verification. Our concept introduces attestations of validity for a point in time, which are issued by the SSI network for credentials that have not been revoked, i.e., added by authorized entities to a revocation list. The concept aims to be generic so that it can be used for various use cases, e.g., by giving users the control over the frequency of re-attestation. To show our concept's feasibility and practicality, we developed and evaluated an implementation that includes an efficient and privacy-preserving showing of credentials using noninteractive zero-knowledge proofs, all while being offline.
Muntadher Sallal, Steve Schneider, Matthew Casey, François Dupressoir · 8 authors
This paper discusses an approach for incremental change to an online voting system, introducing a verifiability layer based on the Selene protocol to a trusted-third-party-based system, resulting in a fully verifiable and transparent e-voting system. The paper also describes how to use Distributed Ledger Technology as a component of the implementation of Selene to manage the verifiability data in a distributed way for resilience and trust.
To prove the graph relations such as the connectivity and the isolation for a certified graph, the system of graph signature and proofs have been proposed. In this system, an issuer generates a signature certifying the topology of an undirected graph, and issues a prover the signature. The prover can prove the knowledge of the signature and the graph in the zero-knowledge, i.e., the signature and the signed graph are hidden. In addition, the prover can prove relations on the certified graph such as the connectivity and isolation between two vertexes. In the previous system, using integer commitments on RSA modulus, the graph relations are proved. However, the RSA modulus needs a longer size of each element. Furthermore, the proof size and the verification cost depend on the total numbers of vertexes and edges. In this paper, we propose a graph signature and proof system, where these are computed on bilinear groups without the RSA modulus. Moreover, using a bilinear map accumulator, the prover can prove the connectivity and isolation on a graph, where the proof size and verification cost become independent from the total numbers of vertexes and edges.
U ovom diplomskom radu je opisan problem korištenja podataka iz vanjskih izvora u kontekstu raspodijeljene glavne knjige koji je poznat u literaturi pod nazivom "oracle problem". Istražena su i opisana postojeća rješenja tog problema te je pojašnjen pojam decentraliziranog oracle sustava. Navedeni su tipovi takvih sustava te je objašnjeno kako oni osiguravaju integritet podataka u blok-lancu eliminirajući jedinstvenu točku ispada. Istražene su postojeće implementacije i funkcionalnosti decentraliziranih rješenja za unos podataka iz nepovjerljivih vanjskih izvora. Razvijeno je programsko rješenje za studijski slučaj koji omogućuje primjenu blok-lanca uz korištenje podataka iz vanjskih izvora gdje se koristi rješenje Chainlink s pametnim ugovorima Ethereuma.
Proof of stake (PoS), aiming at replacing Proof of work (PoW) in blockchain consensus, has drawn great attention from academia and industry. We present “Baguena”, a novel PoS protocol for public blockchain with high practicality and security. It uses a special designed algorithm with properties of uniqueness and anonymity for leader selection, and uses the longest chain rule for chain selection. Besides, entropy is introduced to prevent manipulation of leader selection process by simulating a random beacon based on Publicly verifiable secret sharing (PVSS) and threshold signature with only a linear number of exponentiations. We analyze the protocol's security by a threat model and design a robust delegation mechanism based on triple Elliptic curve digital signature algorithm (ECDSA) proxy signature. We implement Baguena and evaluate its performance on 100 Amazon EC2 virtual machines simulating 50k users, which shows that Baguena confirms transactions in 2 minutes, achieves 2.16x of Algorand's throughput and 6.95x of Ouroboros' throughput.
Asset custody is a core financial service in which the custodian holds in-safekeeping assets on behalf of the client. Although traditional custody service is typically endorsed by centralized authorities, decentralized custody scheme has become technically feasible since the emergence of digital assets, and furthermore, it is greatly needed by new applications such as blockchain and DeFi (Decentralized Finance). In this work, we propose a framework of decentralized asset custody scheme that is able to support a large number of custodians and safely hold customer assets of multiple times the value of the total security deposit. The proposed custody scheme distributes custodians and assets into many custodian groups via combinatorial designs, where each group fully controls the assigned assets. Since every custodian group is small, the overhead cost is significantly reduced. The liveness is also improved because even a single alive group would be able to process transactions. The security of this custody scheme is guaranteed under the rational adversary model, such that any adversary corrupting a bounded fraction of custodians cannot move assets more than the security deposit paid. We further analyze the security and performance of our constructions from both theoretical and experimental sides and give explicit examples with concrete numbers and figures for a better understanding of our results.
Context: Smart contracts and DApps are becoming increasingly important and widespread. DApps are often business-critical, and strong security guarantees must be ensured. However, developing safe and reliable smart contracts remains a challenging task. Despite growing literature, simple and actionable tools to address security issues are still lacking. Objective: This study identifies design patterns and best practices for DApp security. We categorize them into twelve critical areas based on their security goals and map them to the architecture of decentralized applications. For each item, we define concrete actions to support secure implementation. These are further structured into three security assurance checklists. Method: We analyze existing literature and manually review 224 security items, consolidating duplicates and harmonizing terminology. This process results in 84 unique items, divided into 36 design patterns and 48 best practices, further grouped into 12 categories. We also map the items into three checklists based on the development phase of DApp lifecycle. Finally, for each pattern and practice, we derive 374 actionable security tasks to guide secure development. Results: To the best of our knowledge, this is the most comprehensive and structured collection of DApp security items to date. The proposed framework and checklists help developers ensure the consistent and complete application of secure design principles. Conclusion: Focusing on Ethereum and Solidity, we present a comprehensive framework for improving DApp security. Our work supports ongoing efforts to reduce vulnerabilities in decentralized applications and provides developers with practical tools to build safer, more reliable systems.
Given that Proof-of-Work (PoW) and Proof-of-Stake (PoS) are plutocratic, and other common consensus protocols are mostly permission-based, we look for a consensus protocol that will suit the needs of e-Democracy. In particular, what we need is a distributed ledger that will record and, to the possible extent, execute the public will. We propose a combination of any given permission-based protocol together with a trust graph between the nodes, which supplies the required permission for new nodes. As a result, the consensus protocol reaches consensus at every iteration between a known list of agents and then updates this list between iterations. This paper is based on prior work that shows the conditions under which a community can grow while maintaining a bounded number of byzantines. It combines a permission-based consensus protocol (such as pBFT) with a community expansion algorithm (such as the one in the prior work) to arrive at a consensus protocol in which the set of agents can change in time, while being sybil-resilient.
Vulnerabilities of smart contract are certainly one of the limiting factors for wider adoption of blockchain technology. Smart contracts written in Solidity language are considered due to common adoption of the Ethereum blockchain platform. Despite its popularity, the semantics of the language is not completely documented and relies on implicit mechanisms not publicly available and as such vulnerable to possible attacks. In addition, creating formal semantics for the higher-level language provides support to verification mechanisms. In this paper, a novel approach to smart contact verification is presented that uses ontologies in order to leverage semantic annotations of the smart contract source code combined with semantic representation of domain-specific aspects. The following aspects of smart contracts, apart from source code are taken into consideration for verification: business logic, domain knowledge, run-time state changes and expert knowledge about vulnerabilities. Main advantages of the proposed verification approach are platform independence and extendability.
This paper presents an architecture, based on Distributed Ledger Technologies\n(DLTs) and Decentralized File Storage (DFS) systems, to support the use of\nPersonal Information Management Systems (PIMS). DLT and DFS are used to manage\ndata sensed by mobile users equipped with devices with sensing capability. DLTs\nguarantee the immutability, traceability and verifiability of references to\npersonal data, that are stored in DFS. In fact, the inclusion of data digests\nin the DLT makes it possible to obtain an unalterable reference and a\ntamper-proof log, while remaining compliant with the regulations on personal\ndata, i.e. GDPR. We provide an experimental evaluation on the feasibility of\nthe use of DFS. Three different scenarios have been studied: i) a proprietary\nIPFS approach with a dedicated node interfacing with the data producers, ii) a\npublic IPFS service and iii) Sia Skynet. Results show that through proper\nconfiguration of the system infrastructure, it is viable to build a\ndecentralized Personal Data Storage (PDS).\n
Role-based access control (RBAC) policies represent the rights of subjects in terms of roles to access resources. This research proposes a scalable, flexible and auditable RBAC system using the EOS blockchain platform to meet the security requirements of organizations. The EOS blockchain platform for developing smart contract and decentralized applications (DAPPs) aims to address the scalability problem found in existing blockchain platforms. This smart contract platform aims to eliminate transaction fees while conducting millions of transactions per second. In our proposed approach, the EOS blockchain transparently stores RBAC policies. Administrative roles control access to resources at a higher level according to the way organisations perform operations. An organisation creates roles, role hierarchies and constraints to regulate user actions. Therefore, once an RBAC framework is established, the administrative user (issuer) only needs to grant and revoke roles to support changes in the organisational structure. Our proposed blockchain-based RBAC supports delegation capabilities using gaseless transactions which makes it adoptable and appealing in a large number of application scenarios. Our proposed solution is application-agnostic and well-suited for diverse use cases. Existing state-of-the art security frameworks are not suitable due to the difficulty of scale, higher cost and single point of failure. Consequently, organisations demand a scalable, cost-effective and lightweight access control solution which can better protect their privacy as well. A proof of concept implementation is developed based on the EOS blockchain. Our experimental results and analysis clearly show that our EOS blockchain-based RBAC outperforms existing blockchain platforms in terms of cost, latency, block generation time, contract execution time and throughput.
Stefano Angieri, Marcelo Bagnulo, Alberto García-Martínez, Bingyang Liu · 5 authors
In this paper, we present InBlock4, a blockchain-based alternative to RPKI for the provision of Route Origin validation for BGP. InBlock4 embeds an alternative trust model to protect entities obtaining a resource allocations from errors and abuses from other entities in the allocation hierarchy. InBlock4 is compatible with BGPsec. Moreover, InBlock4 can be bootstrapped using the information in the RPKI and it can coexists with RPKI-based route origin validation. In the paper, we also present a working implementation of InBlock4 for Ethereum and we quantify its performance.
Yanhong Xu, Reihaneh Safavi–Naini, Khoa Nguyen, Huaxiong Wang
Policy-based signatures (PBS) were proposed by Bellare and Fuchsbauer (PKC 2014) to allow an {\em authorized} member of an organization to sign a message on behalf of the organization. The user's authorization is determined by a policy managed by the organization's trusted authority, while the signature preserves the privacy of the organization's policy. Signing keys in PBS do not include user identity information and thus can be passed to others, violating the intention of employing PBS to restrict users' signing capability. In this paper, we introduce the notion of {\em traceability} for PBS by including user identity in the signing key such that the trusted authority will be able to open a suspicious signature and recover the signer's identity should the needs arise. We provide rigorous definitions and stringent security notions of traceable PBS (TPBS), capturing the properties of PBS suggested by Bellare-Fuchsbauer and resembling the "full traceability" requirement for group signatures put forward by Bellare-Micciancio-Warinschi (Eurocrypt 2003). As a proof of concept, we provide a modular construction of TPBS, based on a signature scheme, an encryption scheme and a zero-knowledge proof system. Furthermore, to demonstrate the feasibility of achieving TPBS from concrete, quantum-resistant assumptions, we give an instantiation based on lattices.
Zoltán Lux, Dirk Thatmann, Sebastian Zickau, Felix Beierle
Authentication with username and password is becoming an inconvenient process\nfor the user. End users typically have little control over their personal\nprivacy, and data breaches effecting millions of users have already happened\nseveral times. We have implemented a proof of concept decentralized OpenID\nConnect Provider by marrying it with Self-Sovereign Identity, which gives users\nthe freedom to choose from a very large pool of identity providers instead of\njust a select few corporations, thus enabling the democratization of the highly\ncentralized digital identity landscape. Furthermore, we propose a verifiable\ncredential powered decentralized Public Key Infrastructure using distributed\nledger technologies, which creates a straightforward and verifiable way for\nretrieving digital certificates.\n
BACKGROUND: With increased specialization of health care services and high levels of patient mobility, accessing health care services across multiple hospitals or clinics has become very common for diagnosis and treatment, particularly for patients with chronic diseases such as cancer. With informed knowledge of a patient's history, physicians can make prompt clinical decisions for smarter, safer, and more efficient care. However, due to the privacy and high sensitivity of electronic health records (EHR), most EHR data sharing still happens through fax or mail due to the lack of systematic infrastructure support for secure, trustable health data sharing, which can also cause major delays in patient care. OBJECTIVE: Our goal was to develop a system that will facilitate secure, trustable management, sharing, and aggregation of EHR data. Our patient-centric system allows patients to manage their own health records across multiple hospitals. The system will ensure patient privacy protection and guarantee security with respect to the requirements for health care data management, including the access control policy specified by the patient. METHODS: We propose a permissioned blockchain-based system for EHR data sharing and integration. Each hospital will provide a blockchain node integrated with its own EHR system to form the blockchain network. A web-based interface will be used for patients and doctors to initiate EHR sharing transactions. We take a hybrid data management approach, where only management metadata will be stored on the chain. Actual EHR data, on the other hand, will be encrypted and stored off-chain in Health Insurance Portability and Accountability Act-compliant cloud-based storage. The system uses public key infrastructure-based asymmetric encryption and digital signatures to secure shared EHR data. RESULTS: In collaboration with Stony Brook University Hospital, we developed ACTION-EHR, a system for patient-centric, blockchain-based EHR data sharing and management for patient care, in particular radiation treatment for cancer. The prototype was built on Hyperledger Fabric, an open-source, permissioned blockchain framework. Data sharing transactions were implemented using chaincode and exposed as representational state transfer application programming interfaces used for the web portal for patients and users. The HL7 Fast Healthcare Interoperability Resources standard was adopted to represent shared EHR data, making it easy to interface with hospital EHR systems and integrate a patient's EHR data. We tested the system in a distributed environment at Stony Brook University using deidentified patient data. CONCLUSIONS: We studied and developed the critical technology components to enable patient-centric, blockchain-based EHR sharing to support cancer care. The prototype demonstrated the feasibility of our approach as well as some of the major challenges. The next step will be a pilot study with health care providers in both the United States and Switzerland. Our work provides an exemplar testbed to build next-generation EHR sharing infrastructures.
Florian Jacob, Luca Becker, Jan Grashöfer, Hannes Hartenstein
The Matrix message-oriented middleware (see https://matrix.org) is gaining momentum as a basis for a decentralized, secure messaging system as shown, for example, by its deployment within the French government and by the Mozilla foundation. Thus, understanding the corresponding access control approach is important. This paper provides an ab- straction and an analysis of the access control approach followed by Matrix. We show that Matrix can be seen as a form of Distributed Ledger Technology (DLT) based on Transaction-based Directed Acyclic Graphs (TDAGs). TDAGs connect individual transactions to form a DAG, instead of collecting transactions in blocks as in blockchains. These TDAGs only provide causal order, eventual consistency, and no finality. However, unlike conventional DLTs, Matrix does not aim for a strict system-wide consensus. Thus, there is also no guarantee for a strict consensus on access rights. By de- composition of the Matrix approach, we show that a sound decen- tralized access control can be implemented for TDAGs in general, and for Matrix in particular, despite those weak guarantees. In ad- dition, we discovered security issues in popular implementations and emphasize the need for a formal verification of the employed conflict resolution mechanism.
Current cloud and network infrastructures do not employ privacy-preserving methods to protect their assets. Anonymous credential schemes are a cryptographic building block that enables the certification of data structures and prove properties over their representations without disclosing the innards of their data structures in zero-knowledge. The GRaph Signature (GRS) scheme enables the certification and proof methods to sign infrastructure topologies represented as graph data structures and use zero-knowledge to prove properties over their certificates. As such, they represent a powerful privacy-preserving method that proves properties over a signed topology graph to another party without disclosing the blueprint of its topology. In this paper, we report our efforts in designing, implementing and benchmarking a Graph Signature Library (GSL). GSL is a cryptographic library realized in Java that implements the graph signature scheme.
With the development of precise positioning technology, a growing number of location-based services (LBS) emerge. For example, visit a specific place to get the corresponding reward. This also leads to location fraud by illegal users in order to gain benefits. Thus, it is necessary to verify location certificates provided by users. However, present proof of location systems are deficient in verifying users’ location certificates while protecting users’ privacy. Users do not flexibly control their location certificates either. Based on blockchain, a kind of distributed proof of location system architecture was proposed and based on the proposed system architecture, a kind of proof of location protocol with zero-knowledge proof was proposed further. With the proposed architecture and the protocol, the proposed proof of location system allows users to freely select disclosed certificate parameters and positional accuracy according to their needs so that hierarchical location privacy protection was achieved.
Access control has become problematic in several organizations because of the difficulty in establishing security and preventing malicious users from mimicking roles. Moreover, there is no flexibility among users in the participation in their roles, and even controlling them. Several role-based access control (RBAC) mechanisms have been proposed to alleviate these problems, but the security has not been fully realized. In this work, however, we present an RBAC model based on blockchain technology to enhance user authentication before knowledge is accessed and utilized in a knowledge management system (KMS). Our blockchain-based system model and the smart contract ensure that transparency and knowledge resource immutability are achieved. We also present smart contract algorithms and discussions about the model. As an essential part of RBAC model applied to KMS environment, trust is ensured in the network. Evaluation results show that our system is efficient.