Follow blockchain research across journals, conferences, and preprint repositories.
8,503 results · page 193 of 355
Clémence Bouvier, Pierre Briaud, Pyrros Chaidos, Léo Perrin · 7 authors
No abstract is available for this record.
M. Zhang, Yu Chen, Chuanzhou Yao, Zhichao Wang
No abstract is available for this record.
Igor A. Kalmykov, Владимир Копытов, A A Olenev, Daniil Vyacheslavovich Dukhovnyj · 6 authors
The use of a satellite Internet systems (SIS) makes it possible to effectively support technologies such as the Industrial Internet of Things (IIoT). This technology is especially relevant for oil and gas industry enterprises implementing the development of deposits located on the shelf of the Arctic Ocean. As the number of countries and companies engaged in the development of deposits in the Arctic Ocean increases, the number of groupings of low-orbit satellites increases as well. This can lead to a situation when an intruder satellite intercepts a control command and then imposes it on a receiver located on an unattended object. It is possible to reduce the effectiveness of such relay spoofing interference by using the satellite authentication protocol. The conducted studies have shown that authentication protocols with zero-knowledge proof have high cryptographic resistance to a satellite response being correctly picked up. However, they have a drawback. It is a significant time spent on determining the status of the satellite, which is caused by the fact that calculations are performed using a large module (128 or more digits). This disadvantage can be eliminated by using modular residue classes codes (MRCC).
Ziqi Zhu, Kai Zhang, Junqing Gong, Haifeng Qian
No abstract is available for this record.
B. Subashini, D. Hemavathi
Due to an increase in agricultural mislabeling and carelesshandling of non-perishable foods in recent years, consumers have been calling for the food sector to be more transparent. Due to information dispersion between divisions and the propensity to record inaccurate data, current traceability solutions typically fail to provide reliable farm-to-fork histories ofproducts. The three most enticing characteristics of blockchain technology areopenness, integrity, and traceability, which make it a potentially crucial tool for guaranteeing the integrity and correctness of data. In this paper, we suggest a permissioned blockchain system run by organizations, such as regulatory bodies, to promote the origin-tracking of shelf-stable agricultural products. We propose a four-tiered architecture, parallel side chains, Zero-Knowledge Proofs (ZKPs), and Interplanetary File Systems (IPFS). These ensure that information about where an item came from is shared, those commercial competitors cannot get to it, those big storage problems are handled, and the system can be scaled to handle many transactions at once. Thesolution maintains the confidentiality of all transaction flows whenprovenance data is queried utilizing smart contracts and a consumer-grade reliance rate. Extensive simulation testing using Ethereum Rinkeby and Polygon demonstrates reduced execution time, latency, and throughput overheads.
Tjerand Silde
No abstract is available for this record.
Tang Gui, Wuzheng Tan, Mei Cai
In the big data era, machine learning has devel-oped prominently and is widely used in real-world systems. Yet, machine learning raises fairness concerns, which incurs discrimination against groups determined by sensitive attributes such as gender and race. Many researchers have focused on developing fairness audit technique of machine learning model that enable users to protect themselves from discrimination. Existing solutions, however, rely on additional external trust as-sumptions, either on third-party entities or external components, that significantly lower the security. In this study, we propose a trustless verifiable fairness audit framework that assesses the fairness of ML algorithms while addressing potential security issues such as data privacy, model secrecy, and trustworthiness. With succinctness and non-interactive of zero knowledge proof, our framework not only guarantees audit integrity, but also clearly enhance security, enabling fair ML models to be publicly auditable and any client to verify audit results without extra trust assumption. Our evaluation on various machine learning models and real-world datasets shows that our framework achieves practical performance.
Dmitry Khovratovich, Mario Marhuenda Beltrán, Bart Mennink
No abstract is available for this record.
Emanuele Scala, Leonardo Mostarda
No abstract is available for this record.
Lennart Braun, Ivan Damgård, Claudio Orlandi
We construct the first actively-secure threshold version of the cryptosystem based on class groups from the so-called CL framework (Castagnos and Laguillaumie, 2015). We show how to use our threshold scheme to achieve general universally composable (UC) secure multiparty computation (MPC) with only transparent set-up, i.e., with no secret trapdoors involved. On the way to our goal, we design new zero-knowledge (ZK) protocols with constant communication complexity for proving multiplicative relations between encrypted values. This allows us to use the ZK proofs to achieve MPC with active security with only a constant factor overhead. Finally, we adapt our protocol for the so called “You-Only-Speak-Once” (YOSO) setting, which is a very promising recent approach for performing MPC over a blockchain. This is possible because our key generation protocol is simpler and requires significantly less interaction compared to previous approaches: in particular, our new key generation protocol allows the adversary to bias the public key, but we show that this has no impact on the security of the resulting cryptosystem.
Shaorui Song, Lei Xu, Liehuang Zhu
Local differential privacy (LDP) is a promising technique to realize privacy-preserving data aggregation without a trusted aggregator. Normally, an LDP protocol requires each user to locally perturb his raw data and submit the perturbed data to the aggregator. Consequently, LDP is vulnerable to output poisoning attacks. Malicious users can skip the perturbation and submit carefully crafted data to the aggregator, altering the data aggregation results. Existing verifiable LDP protocols, which can verify the perturbation process and prevent output poisoning attacks, usually incur significant computation and communication costs, due to the use of zero-knowledge proofs. In this paper, we analyze the attacks on two classic LDP protocols for frequency estimation, namely GRR and OUE, and propose two verifiable LDP protocols. The proposed protocols are based on an interactive framework, where the user and the aggregator complete the perturbation together. By providing some additional information, which reveals nothing about the raw data but helps the verification, the user can convince the aggregator that he is incapable of launching an output poisoning attack. Simulation results demonstrate that the proposed protocols have good defensive performance and outperform existing approaches in terms of efficiency.
Johannes Blömer, Jan Bobolz, Laurens Porzenheim
No abstract is available for this record.
Peter Chvojka, Tibor Jager
No abstract is available for this record.
Alex Ozdemir, Riad S. Wahby, Fraser Brown, Clark Barrett
Abstract Zero Knowledge Proofs (ZKPs) are cryptographic protocols by which a prover convinces a verifier of the truth of a statement without revealing any other information. Typically, statements are expressed in a high-level language and then compiled to a low-level representation on which the ZKP operates. Thus, a bug in a ZKP compiler can compromise the statement that the ZK proof is supposed to establish. This paper takes a step towards ZKP compiler correctness by partially verifying a field-blasting compiler pass, a pass that translates Boolean and bit-vector logic into equivalent operations in a finite field. First, we define correctness for field-blasters and ZKP compilers more generally. Next, we describe the specific field-blaster using a set of encoding rules and define verification conditions for individual rules. Finally, we connect the rules and the correctness definition by showing that if our verification conditions hold, the field-blaster is correct. We have implemented our approach in the CirC ZKP compiler and have proved bounded versions of the corresponding verification conditions. We show that our partially verified field-blaster does not hurt the performance of the compiler or its output; we also report on four bugs uncovered during verification.
Arasu Arun, Chaya Ganesh, Satya Lokam, Tushar Mopuri · 5 authors
No abstract is available for this record.
Jayamine Alupotha
Decentralized identities return control of identities to the identity owners. Although current work enhances the privacy of these publicly stored identities using encryption and zero-knowledge proofs, decentralized identities can still be abused due to the following problems: identity holders, e.g., blockchain peers, can profile identity owners by looking at “who is reading which identity data”, and identity verifiers, e.g., applications and websites, learn private data about owners, like their monetary values and previous transactions during the identity linking. In the worst case scenario, the identity holders and verifiers collaboratively profile users to learn more information. As a practical solution, we introduce the notion of Double Blind Proofs of Existence (DBPoE), which shows that an opened DID is committed in one of the constant-sized multi-generator Pedersen commitments (33 Bytes at 128-bit security), and nothing else. Hence, our DBPoE double-blinds identity holders and identity verifiers to mitigate private information leakage. Equally importantly, our multi-generator commitment-based DBPoE is more resistant to graph analysis than other one-of-many proofs, e.g., ring signatures, which we show mathematically using the maximal flow problem. Our DBPoE protocol has a size complexity ofO(log2(N) +m) when the real commitment is hidden inNcommitments andmgenerators are used, e.g., whenm= 4, a DBPoE of 1000 commitments is only 3 KB.
Chaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi · 6 authors
Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs) are becoming an increasingly fundamental tool in many real-world applications where the proof compactness is of the utmost importance, including blockchains. A proof of security for SNARKs in the Universal Composability (UC) framework (Canetti, FOCS’01) would rule out devastating malleability attacks. To retain security of SNARKs in the UC model, one must show their simulation-extractability such that the knowledge extractor is both black-box and straight-line , which would imply that proofs generated by honest provers are non-malleable . However, existing simulation-extractability results on SNARKs either lack some of these properties, or alternatively have to sacrifice witness succinctness to prove UC security. In this paper, we provide a compiler lifting any simulation-extractable NIZKAoK into a UC-secure one in the global random oracle model, importantly, while preserving the same level of witness succinctness. Combining this with existing zkSNARKs, we achieve, to the best of our knowledge, the first zkSNARKs simultaneously achieving UC-security and constant sized proofs.
Carlos Aguilar-Melchor, Nicolas Gama, James Howe, Andreas Hülsing · 6 authors
No abstract is available for this record.
Yuyu Wang, C.-J. Su, Jiaxin Pan, Yu Chen
No abstract is available for this record.
Eliana Carozza, Geoffroy Couteau, Antoine Joux
No abstract is available for this record.
Yuan Tian, Xinke Tian, Yongda Pang
No abstract is available for this record.
Axin Wu, Weiqi Luo, Jian Weng, Anjia Yang · 5 authors
Ateniese et al. introduced the primitive of matchmaking encryption (ME) at CRYPTO 2019 and left open several important questions, which include extending ME to fuzzy cases or giving an efficient ME in the identity-based setting without relying on random oracles. The main challenge is to achieve fuzzy bilateral access control while providing identity privacy of the sender and receiver, message confidentiality and authenticity without random oracles. In this work, we resolve the question by formalizing the first fuzzy identity-based ME (IB-ME) and presenting a concrete construction. Specifically, we propose the formal syntax definition of fuzzy IB-ME. In fuzzy IB-ME, the identities of senders and receivers are characterized by attribute sets. A ciphertext can be correctly decrypted if the overlaps between the attribute set of the sender or receiver and the attribute set specified by the other party are simultaneously greater than a threshold, which can be applied to many attractive applications such as fuzzy bilateral access control in online social dating. Then, we present concrete details of fuzzy IB-ME based on fuzzy identity-based encryption, which does not rely on other cryptographic tools such as two-input functional encryption and non-interactive zero-knowledge proof systems. In this process, fuzzy bilateral access control and identity privacy are achieved through the formalism of arranged ME and the splitting technique while message authenticity is provided through the authentication and binding of the encryption key. The identity privacy of the sender and receiver, confidentiality, and authenticity of messages are reduced to the decisional bilinear Diffie-Hellman, decision linear, and computational bilinear Diffie-Hellman assumptions in the selective model without random oracles. Finally, we implement the scheme and evaluate its performance through theoretical analyses and experiments to demonstrate its efficiency.
Thibauld Feneuil, Matthieu Rivain
No abstract is available for this record.
Yuncong Zhang, Shi-Feng Sun, Ren Zhang, Dawu Gu
No abstract is available for this record.