New ZK Protocols Achieve Optimal Linear Prover Time and Distributed Proof Generation
Cryptographers introduced new zero-knowledge protocols that achieve optimal linear-time prover complexity and enable fully distributed proof generation, accelerating ZKP adoption for scalable privacy.
Quantum-Resistant Blockchain Architecture Secures Transactions Using Lattice Cryptography and Sharding
QCG-ST introduces a post-quantum, lattice-based cryptographic layer over a sharded Proof-of-Stake consensus to ensure future-proof security and scalability.
Optimal Polynomial Commitment Batching Unlocks Scalable Decentralized Cryptography
New KZG batching algorithm achieves optimal O(N log N) prover time and constant proof size, dramatically accelerating Verifiable Secret Sharing.
Federated Distributed Key Generation Secures Threshold Cryptography in Dynamic Decentralized Networks
FDKG introduces participant-defined guardian sets, generalizing DKG to dynamic networks and enhancing the resilience of all threshold-based protocols.
Differentially Private Hints Quantify MEV-Share Privacy for Fairer Transactions
This research introduces Differentially Private aggregate hints, enabling users to quantify privacy loss in MEV-Share, fostering fairer and more efficient decentralized exchanges.
Multi-Level Optical PUF Enhances Hierarchical Cryptographic Security for Diverse Networks
This research introduces a novel multi-level optical physical unclonable function, generating adaptable cryptographic keys to secure diverse networks from IoT to sensitive data.
ZKTorch: Efficient, Private ML Inference via Parallel Zero-Knowledge Proof Accumulation
ZKTorch enables private, verifiable ML inference by compiling models into basic blocks, leveraging parallel proof accumulation for efficiency.
Optimistic Rollup Achieves Full Privacy with Efficient Fraud Proofs
Calyx Pioneers Privacy-Preserving Optimistic Rollups, Securing Off-Chain Transactions with a Novel One-Step Fraud-Proof Mechanism, Enhancing Blockchain Confidentiality.
Blockchain-Native Distributed Key Generation Enables On-Chain Verification
A novel Distributed Key Generation protocol leverages blockchain consensus to make public keys verifiable on-chain, enhancing decentralized security and trust minimization.
Publicly Verifiable Private Information Retrieval via Function Secret Sharing
This research introduces publicly verifiable private information retrieval protocols, ensuring data integrity and query privacy simultaneously for decentralized systems.
Succinct Zero-Knowledge Arguments for Unknown Order Homomorphic Encryption
This research introduces novel ZK arguments for the CL cryptosystem, enabling private, verifiable computations in unknown order groups for enhanced privacy.
Zero-Knowledge Mechanisms Enable Private, Verifiable Commitments without Mediators
This framework leverages zero-knowledge proofs for private mechanism commitment and execution, ensuring verifiable properties without disclosure or mediators.
Encrypted Mempools Alone Cannot Solve Maximal Extractable Value
Cryptographically concealing transaction data until execution faces fundamental economic and technical limits, preventing universal MEV mitigation.
Threshold Signatures Enhance Blockchain Security, Decentralization, and Fault Tolerance
A novel cryptographic primitive distributes signing authority across multiple parties, fundamentally mitigating single points of failure and bolstering decentralized system resilience.
Topological Consensus Networks Resolve Blockchain Trilemma with Quantum-Secure Trust Dynamics
Léonne introduces Proof-of-Consensus using topological networks and quantum randomness, fundamentally achieving scalable, secure, and decentralized blockchains.
Zero-Knowledge Proofs: Bridging Theory to Practical Blockchain Applications
Zero-knowledge proofs are transitioning from theoretical cryptography to practical applications, offering scalable privacy and verifiable computation across decentralized systems.
Practical Verifiable Computation over Homomorphically Encrypted Data
A novel transformation for Interactive Oracle Proofs enables efficient verification of computations on encrypted data in the plaintext space.
One-Sided Permutation Enhances Private Set Intersection Efficiency and Privacy
A novel Private Set Intersection protocol leverages one-sided permutations, fundamentally advancing secure data collaboration by optimizing privacy and computational efficiency for asymmetric datasets.
Quantum Zero-Knowledge Resists Superposition Attacks with Learning Errors
Researchers introduce novel zero-knowledge protocols, secured by Learning With Errors, to withstand quantum superposition attacks, ensuring privacy in a post-quantum cryptographic landscape.
Decentralized Private Vertical Federated Learning with Novel Feature Sharing Consensus
SecureVFL integrates a permissioned blockchain, a novel Proof of Feature Sharing consensus, and Replicated Secret Sharing for private, verifiable multi-party federated learning.
Code-Based Zero-Knowledge Proofs Enhance Post-Quantum Cryptographic Security
This research introduces novel code-based zero-knowledge proofs, including HammR and a syndrome decoding protocol, fundamentally advancing quantum-resilient cryptography and secure digital signatures.
