Cryptographic Protocols — Entidade

eprint.iacr.org·há 4 dias

Anamorphic Messaging: Analyzing the Double Ratchet, Triple Ratchet, PQ3, and MLS

Anamorphic cryptography targets the scenario in which a dictator does not forbid the use of cryptography but requires all users to reveal their secret keys to them. Thus, the dictator can decrypt all

eprint.iacr.org·há 5 dias

Limber: Low Overhead SNARKs for Integers from Any PCS

Non-native arithmetic is a key bottleneck in SNARK design. It introduces large overheads, and application designers often have to avoid it through the use of non-standard arithmetization friendly hash

eprint.iacr.org·há 6 dias

Adaptive-Input-Secure Updatable Private Set Union

In multi-epoch deployments, private set union~(PSU) operates in an adaptive-input loop: after observing the union at epoch $t$, the receiver may choose its next input for epoch $t+1$. Liu et al.~(EURO

eprint.iacr.org·há 10 dias

Privacy-Preserving Inclusion Lists

Blockchains aim to provide open access and censorship resistance, but centralization of block production in blockchains like Ethereum undermines these goals. Inclusion List (IL) protocols mitigate thi

eprint.iacr.org·há 13 dias

Anchor-DKG: Distributed Key Generation with Repeating Parties

A party may participate in multiple threshold cryptosystems. For example, it may serve on multiple overlapping threshold committees in a proof-of-stake blockchain or a distributed oracle network, or a

eprint.iacr.org·há 14 dias

BORG: Extendable Distributed Vector Commitments from Reconfigurable Erasure Codes

Updatable vector commitments let users store and authenticate values contained within an evolving data vector. Existing work on updatable vector commitments studies how clients can store only the valu

eprint.iacr.org·há 17 dias

Just-in-Time-OPRFs and a Modular Framework for Fast Private Set Intersection

This paper gives a modular and unified framework within which to derive fast protocols for Private Set Intersection (PSI). At the core of this is a new primitive, that we define, and that we call a Ju

eprint.iacr.org·há 18 dias

On the Suitability of Syndrome Decoding for Proof-of-Work under Quantum Adversaries: Design and Analysis

Proof-of-work (PoW) remains a fundamental mechanism for achieving decentralized consensus, most commonly instantiated using cryptographic hash functions. In such constructions, mining takes the for