Follow blockchain research across journals, conferences, and preprint repositories.
3,460 results · page 132 of 145
Macià Mut–Puigserver, M. Magdalena Payeras–Capellà, Miquel À. Cabot-Nadal
No abstract is available for this record.
Huirui Han, Mengxing Huang, Yu Zhang, Uzair Aslam Bhatti
No abstract is available for this record.
Esteban Landerreche, Marc Stevens
Recently we presented a single-party cryptographic timestamping mechanism based on proof-of-sequential-work, which we proved secure in the universal composability framework [16]. This paper describes this construction and its security claims and uses it to construct a multi-party permissioned blockchain protocol and show that it achieves an immutability notion. Finally we discuss applications of this protocol, including unpermissioned blockchains, and how these may benefit.
Jingyi Li, Jigang Wu, Long Chen, Jiaxing Li
No abstract is available for this record.
Yongjun Ren, Linhui Kong, Yepeng Liu, Jin Wang
No abstract is available for this record.
Fangze Yang
In recent years, there has been an upsurge of researching and learning the Amoeba management model in China. Amoeba management model is a business model created by INAMORI KAZUO in KYOCERA, and then many enterprises have achieved unprecedented success. At present, a large number of scholars have studied the amoeba management model, but the exploration of the operation mechanism of the amoeba management model has not yet appeared. As for an organization management model, it is very important to explore the mechanism for its normal operation, which provides the research question for this article, namely, the operation mechanism of amoeba organization model. Therefore, based on the characteristics of Amoeba organization, this paper explores the operation mechanism of Amoeba’s organizational model, which provides reference for other enterprises that want to implement the Amoeba organization model. The research found that the operation mechanism of Amoeba’s organizational model mainly includes Amoeba’s team relationship, team incentive mechanism, team accounting mechanism and team evaluation mechanism. The Amoeba team broke the traditional relationship between the corporate sector and the traditional relationship resulting in low efficiency of the enterprise, while the amoeba organization leads the trading relationship into the enterprise Amoeba teams, the trading between teams, and self-financing of each team resulting in the active communication between teams and the actively cooperate. The Incentive mechanism is mainly for the amoeba team decentralization, the establishment of a strict responsibility and profit mechanism for each team, the division of power and responsibility, so that each team has its own power. The accounting mechanism and the accounting of Amoeba organization model mainly introduce the independent accounting mechanism; each team is responsible for its own profit and loss, independent accounting, and uses the unit time accounting system to calculate the team. The Evaluation mechanism rigorously assesses the amoeba team. In the light of the strategy at this stage of the company, we need to build a guiding evaluation system so that the team goals and corporate goals become same, and commonly achieve the enterprise strategies.
Srinath Setty, Sebastian Angel, Trinabh Gupta, Jonathan Lee
This paper introduces Spice, a system for building verifiable state machines (VSMs). A VSM is a request-processing service that produces proofs establishing that requests were executed correctly according to a specification. Such proofs are succinct (a verifier can check them efficiently without reexecution) and zero-knowledge (a verifier learns nothing about the content of the requests, responses, or the internal state of the service). Recent systems for proving the correct execution of stateful computations--Pantry [25], Geppetto [34], CTV [30], vSQL [83], etc.--implicitly implement VSMs, but they incur prohibitive costs. Spice reduces these costs significantly with a new storage primitive. More notably, Spice's storage primitive supports multiple writers, making Spice the first system that can succinctly prove the correct execution of concurrent services. We find that Spice running on a cluster of 16 servers achieves 488-1167 transactions/second for a variety of applications including inter-bank transactions [27], cloud-hosted ledgers [28], and dark pools [63]. This represents an 18,000-685,000× higher throughput than prior work.
Denis Nasonov, Alexander Visheratin, Alexander V. Boukhanovsky
No abstract is available for this record.
Borja Bordel, Ramón Alcarria, Diego R. Martín, Álvaro Sánchez-Picot
No abstract is available for this record.
Dayu Jia, Junchang Xin, Zhiqiong Wang, Wei Guo · 5 authors
No abstract is available for this record.
Mads Frederik Madsen, Mikkel Gaub, Malthe Ettrup Kirkbro, Tróndur Høgnason · 6 authors
We study distributed declarative workflow execution in an adversarial setting.In this setting, parties to an agreed-upon workflow do not trust each other to follow that workflow, or suspect the other party might misrepresent proceedings at a later time.We demonstrate how distributed declarative workflow execution can be implemented as smart contracts, guaranteeing (I) enforcement of workflow semantics, and (II) an incontrovertible record of workflow execution history.Crucially, we achieve both properties without relying on a trusted third party.The implementation is based on the Ethereum blockchain, inheriting the security properties (I) and (II) from the guarantees given by that chain.A recurring challenge for both the implementation and the analysis is the cost of operations on Ethereum: This cost must be minimised for honest parties, and an adversary must be prevented from inflicting extra cost on others.
Yuan Zhang, Xiaodong Lin, Chunxiang Xu
No abstract is available for this record.
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.
Hoang-Long Nguyen, Claudia‐Lavinia Ignat, Olivier Perrin
Public key server is a simple yet effective way of key management in secure end-to-end communication. To ensure the trustworthiness of a public key server, transparent log systems such as CONIKS employ a tamper-evident data structure on the server and a gossiping protocol among clients in order to detect compromised servers. However, due to lack of incentive and vulnerability to malicious clients, a gossiping protocol is hard to implement in practice. Meanwhile, alternative solutions such as EthIKS are not scalable. This paper presents Trusternity, an auditing scheme relying on Ethereum blockchain that is easy to implement, scalable and inexpensive to operate.
Chunhua Li, Jiaqi Hu, Ke Zhou, Wang Yuan-zhang · 5 authors
No abstract is available for this record.
Po-Yeuan Chang, Min‐Shiang Hwang, Chao-Chen Yang
No abstract is available for this record.
Wilson Abel Alberto Torres, Ron Steinfeld, Amin Sakzad, Joseph K. Liu · 8 authors
No abstract is available for this record.
Wenshi Wang
No abstract is available for this record.
Masayuki Abe, Charanjit S. Jutla, Miyako Ohkubo, Arnab Roy
We construct the first (almost) tightly-secure unbounded-simulation-sound quasi-adaptive non-interactive zero-knowledge arguments (USS-QA-NIZK) for linear-subspace languages with compact (number of group elements independent of the security parameter) common reference string (CRS) and compact proofs under standard assumptions in bilinear-pairings groups. In particular, under the SXDH assumption, the USS-QA-NIZK proof size is only seventeen group elements with a factor \(O(\log {Q})\) loss in security reduction to SXDH. The USS-QA-NIZK primitive has many applications, including structure-preserving signatures (SPS), CCA2-secure publicly-verifiable public-key encryption (PKE), which in turn have applications to CCA-anonymous group signatures, blind signatures and unbounded simulation-sound Groth-Sahai NIZK proofs. We show that the almost tight security of our USS-QA-NIZK translates into constructions of all of the above applications with (almost) tight-security to standard assumptions such as SXDH and, more generally, \(\mathcal{D}_k\)-MDDH. Thus, we get the first publicly-verifiable (almost) tightly-secure multi-user/multi-challenge CCA2-secure PKE with practical efficiency under standard bilinear assumptions. Our (almost) tight SPS construction is also improved in the signature size over previously known constructions.
Ajay Kumar Shrestha, Julita Vassileva
No abstract is available for this record.
Fan Zhang, Philip Daian, Iddo Bentov, Ari Juels
No abstract is available for this record.
Moneeb Ahmed, Ihsan Elahi, Muhammad Abrar, Umair Aslam · 6 authors
In last decade, we have seen the emergence of various computer technologies, each of which was disrupting and revolutionary. Some of these technologies paved the way for a newer generation of technologies to make our lives easier. Some of these technologies are in the category of invention, as they change and disrupt the entire ecosystem. There was a big wave that produced a lot of new billionaires and millionaires. What was available for just 2 cents in 2009 is now available for more than $15,000 US. Yes, we are talking about Bitcoin and Blockchain. Blockchain is the technology behind Bitcoin. Cryptocurrency and especially Bitcoin have certainly divided the world into two zones—one that supports cryptocurrency and the other that opposes it. The use of cryptocurrency has been such a craze that there are around 1400+ cryptocurrencies like Bitcoin in the market, having more than 17+ million accounts. People have raised doubts about the future of Bitcoin. A few countries don’t allow cryptocurrencies in their economies, but almost all of them have provided tremendous support for Blockchain. Bitcoin is just one of the finest implementations of Blockchain, but Blockchain is certainly going to stay and is currently transforming the way we trust across work and business.
Xuanyu Liu, Xiao Fu, Bin Luo, Xiaojiang Du
No abstract is available for this record.
Zhi Li, Layne Liu, Ali Vatankhah Barenji, Waiming Wang
This paper proposes a cloud-based manufacturing knowledge sharing system for injection mould redesign (IMR) based on blockchain technology. In our proposed system, private cloud is used to store the IMR knowledge, and blockchain provides standards and protocols for implementing the system as well as ensuring the security in a trustless environment. K-Nearest Neighbors is used for retrieving the blockchain-based document knowledge. The proposed system not only can facilitate injection mould redesign, but also provide a mechanism for knowledge owners to share their own assets securely.