-
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
-
Some comments on the CSIDH group action
Lorenz Panny recently wrote a detailed and interesting blog post with the title CSI‑FiSh really isn’t polynomial‑time. The purpose of this post is to give some more context and discussion, and mention some recent papers. CSIDH is an isogeny-based primitive. … Continue reading → Go to Source
-
Equivalence between CDH and DLP
(Apologies I wrote this quickly and there may be typos.) The paper Dlog is Practically as Hard (or Easy) as DH – Solving Dlogs via DH Oracles on EC Standards by Alexander May and Carl Richard Theodor Schneider seems to … Continue reading → Go to Source
-
EdDSA standardized
A new version of the NIST Federal Information Processing Standard (FIPS) for Digital Signatures has been published. Also see here. This version includes EdDSA. There are (at least) two notable features of EdDSA. First, it is more closely related to … Continue reading → Go to Source
-
Attacks on SIDH/SIKE
You may feel like you are having trouble keeping up with the news on SIDH/SIKE. So am I! I hope this blog post doesn’t instantly become obsolete due to new advances. To recall, there are now three preprints giving attacks … Continue reading → Go to Source