Blockchain Papers

Benjamin E. Diamond, Jim Posen

No abstract is available for this record.

Dung Bui, Kelong Cong, Cyprien Delpech de Saint Guilhem

No abstract is available for this record.

Takahiro Matsuda

No abstract is available for this record.

Amit Agarwal, Carsten Baum, Lennart Braun, Peter Schöll

No abstract is available for this record.

A. E. E. Dubois, Michael Klooß, Russell W. F. Lai, Ivy K. Y. Woo

No abstract is available for this record.

Pedro Branco, Arka Rai Choudhuri, Nico Döttling, Abhishek Jain · 6 authors

No abstract is available for this record.

Yuhui Zhang, Yang Feng, Huijian Han, Yichao Ma · 7 authors

No abstract is available for this record.

Kaarel August Kurik, Peeter Laud

No abstract is available for this record.

Cyprian Omukhwaya Sakwa, Andrew Omala Anyembe, Fagen Li

No abstract is available for this record.

Dan Boneh, Aditi Partap, Brent Waters

No abstract is available for this record.

Charlotte Hoffmann, Krzysztof Pietrzak

No abstract is available for this record.

Chris Gilbert, Mercy Abiola Gilbert

As blockchain technology continues to evolve, the pursuit of privacy has become a significant challenge. Although the transparency and immutability of blockchain are essential features, they can unintentionally expose sensitive information. This paper investigates the potential of Zero-Knowledge Proofs (ZKPs) and Secure Multi-Party Computation (SMPC) as innovative solutions to address these privacy concerns. ZKPs facilitate the verification of information without disclosing the underlying data, thereby enhancing privacy in transactions and identity verification processes. Meanwhile, SMPC enables collaborative computations while preserving the confidentiality of inputs, which is vital for industries such as finance and healthcare. Despite their potential, these technologies encounter challenges related to complexity, scalability, and regulatory compliance. This study offers a thorough analysis of ZKPs and SMPC, their applications, and the ethical implications involved, providing valuable insights into their role in creating a secure and privacy-conscious blockchain ecosystem.

Roozbeh Sarenche, Svetla Nikova⋆, Bart Preneel

No abstract is available for this record.

Thi Tuyet Trinh Nguyen, Hoai An Le Thi

No abstract is available for this record.

Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini · 8 authors

No abstract is available for this record.

Carmit Hazay, David Heath, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam · 5 authors

No abstract is available for this record.

Fuchun Joseph Lin, Chaoping Xing, Yizhou Yao

No abstract is available for this record.

Guofeng Tang, Shuai Han, Li Lin, Changzheng Wei · 5 authors

With the demand of cryptocurrencies, threshold ECDSA recently regained popularity. So far, several methods have been proposed to construct threshold ECDSA, including the usage of OT and homomorphic encryptions (HE). Due to the mismatch between the plaintext space and the signature space, HE-based threshold ECDSA always requires zero-knowledge range proofs, such as Paillier and Joye-Libert (JL) encryptions. However, the overhead of range proofs constitutes a major portion of the total cost.

Vadim Lyubashevsky, Gregor Seiler, Patrick Steuer

The hardness of lattice problems offers one of the most promising security foundations for quantum-safe cryptography. Basic schemes for public key encryption and digital signatures are already close to standardization at NIST and several other standardization bodies, and the research frontier has moved on to building primitives with more advanced privacy features. At the core of many such primitives are zero-knowledge proofs. In recent years, zero-knowledge proofs for (and using) lattice relations have seen a dramatic jump in efficiency and they currently provide arguably the shortest, and most computationally efficient, quantum-safe proofs for many scenarios. The main difficulty in using these proofs by non-experts (and experts!) is that they have a lot of moving parts and a lot of internal parameters depend on the particular instance that one is trying to prove.

Changrui Mu, Prashant Nalini Vasudevan

Abstract In an Instance-Hiding Interactive Proof (IHIP) (Beaver et al., in: Menezes and Vanstone (eds) Advances in cryptology—CRYPTO 1990, proceedings, lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics), Springer, pp 326–338, 1990), an efficient verifier with a private input x interacts with an unbounded prover to determine whether x is contained in a language $$\mathcal {L}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>L</mml:mi> </mml:math> . In addition to completeness and soundness, the instance-hiding property requires that the prover should not learn anything about x in the course of the interaction. Such proof systems capture natural privacy properties and may be seen as a generalization of the influential concept of randomized encodings (Ishai and Kushilevitz, in: Proceedings 41st annual symposium on foundations of computer science, pp 294–304, 2000; Applebaum et al., in: 45th annual IEEE symposium on foundations of computer science, pp 166–175, 2004; Agrawal et al., in: Halldórsson, Iwama, Kobayashi, Speckmann (eds) Automata, languages, and programming, Springer, Berlin, Heidelberg, pp 1–13, 2015) and as a counterpart to zero-knowledge proofs (Goldwasser et al., in: Symposium on the theory of computing, 1985). We investigate the properties and power of such instance-hiding proofs and show the following: Any language with an IHIP is contained in $${\mathsf {NP/poly}}\cap {\mathsf {coNP/poly}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mrow> <mml:mi>NP</mml:mi> <mml:mo>/</mml:mo> <mml:mi>poly</mml:mi> </mml:mrow> <mml:mo>∩</mml:mo> <mml:mrow> <mml:mi>coNP</mml:mi> <mml:mo>/</mml:mo> <mml:mi>poly</mml:mi> </mml:mrow> </mml:mrow> </mml:math> . If an average-case hard language has a constant-round IHIP, then infinitely often non-uniform one-way functions exist. There is an oracle with respect to which there is a language that has an IHIP but not an SZK proof. IHIP’s are closed under composition with any efficiently computable function. We further study a stronger version of IHIP (that we call Simulatable IHIP) where the view of the honest prover can be efficiently simulated. For these, we obtain stronger versions of some of the above: Any language with a Simulatable IHIP is contained in $${\textsf{AM}}\cap {\textsf{coAM}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>AM</mml:mi> <mml:mo>∩</mml:mo> <mml:mi>coAM</mml:mi> </mml:mrow> </mml:math> . If a worst-case hard language has a Simulatable IHIP, then explicit uniform one-way functions exist.

Noor Athamnah, Eden Florentz – Konopnicki, Ron D. Rothblum

No abstract is available for this record.

Trevor Conley, Nady Carolina Díaz, Diego Espada, Alvin Kuruvilla · 6 authors

No abstract is available for this record.

Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan

No abstract is available for this record.

Janak Dhokrat, Namita Pulgam, Tabassum Maktum, Vanita Mane

In digital landscape of today’s ongoing world, the imperative for enhanced security in cloud-based data processing is paramount. This paper introduces an innovative framework that seamlessly integrates Homomorphic Encryption and Zero-Knowledge Proofs (ZKPs) to bolster data privacy and confidentiality. This paper explores the technical intricacies, real-world applications, and potential implications of this fusion framework. Homomorphic Encryption empowers computations on encrypted data without compromising privacy, while Zero-Knowledge Proofs offer a mechanism to verify computations without exposing sensitive details. The effectiveness and adaptability of the proposed framework is demonstrated through meticulous analysis and practical deployment in safeguarding cloud-based data processing. The proposed framework marks a significant stride towards creating an environment where data security is unequivocally prioritized.