-
Compact Key Storage in the Standard Model
ePrint Report: Compact Key Storage in the Standard Model Yevgeniy Dodis, Daniel Jost In recent work [Crypto’24], Dodis, Jost, and Marcedone introduced Compact Key Storage (CKS) as a modern approach to backup for end-to-end (E2E) secure applications. As most E2E-secure applications rely on a sequence of secrets $(s_1,…,s_n)$ from which, together with the ciphertexts sent…
-
Asymptotically Optimal Adaptive Asynchronous Common Coin and DKG with Silent Setup
ePrint Report: Asymptotically Optimal Adaptive Asynchronous Common Coin and DKG with Silent Setup Hanwen Feng, Qiang Tang This paper presents the first optimal-resilient, adaptively secure asynchronous common coin protocol with $O(lambda n^2)$ communication complexity and $O(1)$ rounds, requiring only a public silent setup. Our protocol immediately implies a sequence of quadratic-communication, constant-round asynchronous Byzantine agreement…
-
MicroNova: Folding-based arguments with efficient (on-chain) verification
ePrint Report: MicroNova: Folding-based arguments with efficient (on-chain) verification Jiaxing Zhao, Srinath Setty, Weidong Cui We describe the design and implementation of MicroNova, a folding-based recursive argument for producing proofs of incremental computations of the form $y = F^{(ell)}(x)$, where $F$ is a possibly non-deterministic computation (encoded using a constraint system such as R1CS), $x$…
-
Non Linearizable Entropic Operator
ePrint Report: Non Linearizable Entropic Operator Daniel Nager In [Pan21] a linearization attack is proposed in order to break the cryp- tosystem proposed in [Gli21]. We want to propose here a non-linearizable operator that disables this attack as this operator doesn’t give raise to a quasigrup and doesn’t obey the latin square property. Go to…
-
NMFT: A Copyrighted Data Trading Protocol based on NFT and AI-powered Merkle Feature Tree
ePrint Report: NMFT: A Copyrighted Data Trading Protocol based on NFT and AI-powered Merkle Feature Tree Dongming Zhang, Lei Xie, Yu Tao With the rapid growth of blockchain-based Non-Fungible Tokens (NFTs), data trading has evolved to incorporate NFTs for ownership verification. However, the NFT ecosystem faces significant challenges in copyright protection, particularly when malicious buyers…
-
Efficient Multi-party Private Set Union Resistant to Maximum Collusion Attacks
ePrint Report: Efficient Multi-party Private Set Union Resistant to Maximum Collusion Attacks Qiang Liu, Joon-Woo Lee Multi-party Private Set Union (MPSU) enables multiple participants to jointly compute the union of their private sets without leaking any additional information beyond the resulting union. Liu et al. (ASIACRYPT 2023) presented the first MPSU protocol that scales to…
-
A Note on the Minimality of One-Way Functions in Post-Quantum Cryptography
ePrint Report: A Note on the Minimality of One-Way Functions in Post-Quantum Cryptography Sam Buxbaum, Mohammad Mahmoody In classical cryptography, one-way functions (OWFs) play a central role as the minimal primitive that (almost) all primitives imply. The situation is more complicated in quantum cryptography, in which honest parties and adversaries can use quantum computation and…
-
Secure Vault scheme in the Cloud Operating Model
ePrint Report: Secure Vault scheme in the Cloud Operating Model Rishiraj Bhattacharyya, Avradip Mandal, Meghna Sengupta The rising demand for data privacy in cloud-based environments has led to the development of advanced mechanisms for securely managing sensitive information. A prominent solution in this domain is the “Data Privacy Vault,” a concept that is being provided…
-
Exploring Large Integer Multiplication for Cryptography Targeting In-Memory Computing
ePrint Report: Exploring Large Integer Multiplication for Cryptography Targeting In-Memory Computing Florian Krieger, Florian Hirner, Sujoy Sinha Roy Emerging cryptographic systems such as Fully Homomorphic Encryption (FHE) and Zero-Knowledge Proofs (ZKP) are computation- and data-intensive. FHE and ZKP implementations in software and hardware largely rely on the von Neumann architecture, where a significant amount of…
-
New cryptanalysis of M-SIDH isogeny cryptography
This post is about the paper A polynomial time attack on instances of M-SIDH and FESTA by Wouter Castryck and Frederik Vercauteren. As we all know, SIDH was broken in 2022 by using knowledge of exact images of torsion points … Continue reading → Go to Source