Verifiable Quantum Randomness Secures Decentralized Systems and Cryptography
QRiNG leverages quantum physics and blockchain consensus to generate provably true random numbers, fundamentally enhancing security and fairness in decentralized applications.
Achilles: TEE-Assisted BFT Consensus with Rollback Resilient Recovery
This research introduces a novel Byzantine Fault Tolerant consensus protocol that leverages Trusted Execution Environments to reduce replica count and ensure liveness during TEE failures.
VRFs Enable Deterministic, Fair Leader Election in Asynchronous Byzantine Consensus
This research pioneers integrating Verifiable Random Functions for provably fair, deterministic leader election in asynchronous Byzantine consensus, enhancing protocol efficiency and security.
Sublinear-Space Zero-Knowledge Proofs Enable Efficient On-Device Verification
This research introduces the first sublinear-space zero-knowledge prover, reframing proof generation as a tree evaluation problem to unlock on-device verifiable computation.
Indistinguishability Obfuscation Enhanced with Lattice-Based Security
Researchers have refined indistinguishability obfuscation, enabling it to rely solely on the standard Learning With Errors assumption, promising more robust and practical privacy-preserving cryptographic primitives.
Fully Homomorphic Encryption Enables Private Shared State on Blockchains
Fully Homomorphic Encryption, offloaded to coprocessors, enables collaborative computation on encrypted blockchain data, fostering truly private shared state.
Zero-Knowledge Proofs: Applications, Infrastructure, and Future Directions
This comprehensive survey illuminates how Zero-Knowledge Proofs enable privacy and scalability across diverse digital systems, from blockchain to AI.
PLONK: Universal, Updatable SNARKs with Efficient Prover Performance
PLONK introduces a novel SNARK construction that significantly reduces prover overheads while maintaining universal and updatable trusted setups, enabling practical verifiable computation.
Unveiling Efficient Non-Interactive Zero-Knowledge Proofs Sans Trusted Setup
A non-interactive zero-knowledge proof system merges algebraic and circuit statements, eliminating trusted setup for enhanced privacy and verifiable computation.
