Practical mempool privacy via one-time setup batched threshold encryption

AR Choudhuri, S Garg, GV Policharla… - Cryptology ePrint …, 2024 - eprint.iacr.org
An important consideration with the growth of the DeFi ecosystem is the protection of clients
who submit transactions to the system. As it currently stands, the public visibility of these …

Extractable Witness Encryption for Arithmetic Circuit Satisfiability Problem

Y Wang, M Zhang - IEEE Internet of Things Journal, 2025 - ieeexplore.ieee.org
Witness encryption (WE)(Garg et al, STOC 2013) allows a message to be encrypted using a
description of a difficult problem (an NP instance), while anyone who knows a solution to the …

Private Laconic Oblivious Transfer with Preprocessing

R Bhadauria, N Döttling, C Hazay, C Lin - Cryptology ePrint Archive, 2024 - eprint.iacr.org
Laconic cryptography studies two-message protocols that securely compute on large
amounts of data with minimal communication cost. Laconic oblivious transfer (OT) is a …

Constant-Cost Batched Partial Decryption in Threshold Encryption

S Suegami, S Ashizawa, K Shibano - Cryptology ePrint Archive, 2024 - eprint.iacr.org
Threshold public key encryption schemes distribute secret keys among multiple parties,
known as the committee, to reduce reliance on a single trusted entity. However, existing …

Improved Polynomial Division in Cryptography

KK Chalkias, C Jutla, J Lindstrom, V Madathil… - Cryptology ePrint …, 2024 - eprint.iacr.org
Several cryptographic primitives, especially succinct proofs of various forms, transform the
satisfaction of high-level properties to the existence of a polynomial quotient between a …