Cryptology ePrint Archive striveceo.github.io

Parasol Compiler: Pushing the Boundaries of FHE Program Efficiency

eprint.iacr.org·47w

LZKSA: Lattice-Based Special Zero-Knowledge Proofs for Secure Aggregation's Input Verification

eprint.iacr.org·47w

ZK-NR: A Layered Cryptographic Architecture for Explainable Non-Repudiation

eprint.iacr.org·47w

Reusable Designated Verifier NIZK from Lossy Trapdoor Functions

eprint.iacr.org·47w

Toxic Decoys: A Path to Scaling Privacy-Preserving Cryptocurrencies

eprint.iacr.org·47w

Strong Secret Sharing with Snitching

eprint.iacr.org·48w

The Pipes Model for Latency Analysis

eprint.iacr.org·48w

High-Throughput Permissionless Blockchain Consensus under Realistic Network Assumptions

eprint.iacr.org·48w

SEAF: Secure Evaluation on Activation Functions with Dynamic Precision for Secure Two-Party Inference

eprint.iacr.org·48w

TEEMS: A Trusted Execution Environment based Metadata-protected Messaging System

eprint.iacr.org·48w

Tanuki: New Frameworks for (Concurrently Secure) Blind Signatures from Post-Quantum Groups Actions

eprint.iacr.org·48w

Lattice-Based Accumulator and Application to Anonymous Credential Revocation

eprint.iacr.org·48w

CuFDFB: Fast and Private Computation on Non-Linear Functions Using FHE

eprint.iacr.org·48w

On the Concrete Security of BBS/BBS+ Signatures

eprint.iacr.org·48w

Concrete Treatment of Signal Handshake’s Deniability: Efficient Post-Quantum Deniable Ring Signature

eprint.iacr.org·48w

Fairness in the Wild: Secure Atomic Swap with External Incentives

eprint.iacr.org·48w

SmallWood: Hash-Based Polynomial Commitments and Zero-Knowledge Arguments for Relatively Small Instances

eprint.iacr.org·48w

How to (not) combine Oblivious Pseudorandom Functions

eprint.iacr.org·48w

FABLE: Batched Evaluation on Confidential Lookup Tables in 2PC

eprint.iacr.org·48w

Weight reduction in distributed protocols: new algorithms and analysis

eprint.iacr.org·48w

Log in to enable infinite scrolling