Scaling Up Blockchains with Zero-Knowledge Proofs - zkSync and ZK Rollups
Explore zero-knowledge proofs and their role in scaling blockchain technology, focusing on zkSync's approach to enhancing Ethereum's scalability while maintaining decentralization and security.
Stacked Garbling for Disjunctive Zero-Knowledge Proofs
Explore advanced cryptographic techniques for disjunctive zero-knowledge proofs, focusing on stacked garbling and its applications in secure computation and privacy-preserving protocols.
Non-Interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions
Explore advanced cryptographic techniques for non-interactive zero-knowledge proofs in pairing-free groups, focusing on improved constructions and weaker assumptions.
Towards Standardizing Zero Knowledge
Overview of ZKProof standardization efforts, challenges, and progress towards composable security for succinct non-interactive zero-knowledge proofs, with implications for emerging standards.
From Laconic Zero Knowledge to Public Key Cryptography
Explore the connection between laconic zero-knowledge proofs and public key cryptography, examining key concepts, results, and implications for cryptographic systems.
"Many-out-of-Many" Proofs and Applications to Anonymous Zether
Explore privacy-enhancing techniques for cryptocurrencies, focusing on Anonymous Zether and the innovative "Many-out-of-Many" zero-knowledge proofs, with technical insights and practical examples.
Double-Efficient ZkSNARKs Without Trusted Setup
Explores efficient zkSNARKs without trusted setup, introducing Hyrax - a new zero-knowledge argument for NP with low communication complexity and concrete costs, based on standard cryptographic assumptions.
ZeeStar - Private Smart Contracts by Homomorphic Encryption and Zero-Knowledge Proofs
Explore innovative privacy techniques for smart contracts using homomorphic encryption and zero-knowledge proofs, enhancing security and confidentiality in blockchain applications.
Zero Knowledge for Everything and Everyone - Fast ZK Processor with Cached ORAM for ANSI C Programs
Explore fast ZK processors with cached ORAM for ANSI C programs, enhancing efficiency in zero-knowledge proofs and expanding their applications across various domains.
Ouroboros Crypsinous Privacy Preserving Proof of Stake
Explore privacy-preserving proof-of-stake blockchain protocol, focusing on adaptive security and novel cryptographic techniques for enhanced privacy in decentralized systems.
Transparent SNARKs from DARK Compilers
Explore transparent SNARKs and DARK compilers in cryptography. Learn about polynomial commitments, interactive proof systems, and recent advancements in zero-knowledge proofs for blockchain applications.
Efficient Zero Knowledge Proof from Interactive Proofs
Explore efficient zero-knowledge proofs derived from interactive proofs, focusing on new algorithms, performance improvements, and comparisons to existing systems.
Homomorphic Encryption in the SPDZ Protocol for MPC
Explore homomorphic encryption in SPDZ protocol for secure multi-party computation, covering threshold encryption, distributed decryption, and zero-knowledge proofs for improved security and efficiency.
Signatures, Commitments, Zero-Knowledge, and Applications
Explore lattice-based cryptography, focusing on polynomial rings, homomorphic encryption, and zero-knowledge proofs. Learn about theoretical foundations and practical applications in modern cryptographic systems.
Berkeley in the 80s - Episode 1- Shafi Goldwasser
Insightful interview with Turing Laureate Shafi Goldwasser, exploring her groundbreaking research in theoretical computer science, interactive proofs, and zero-knowledge protocols at UC Berkeley in the 1980s.
New Techniques for Zero-Knowledge- Leveraging Inefficient Provers to Reduce Assumptions
Explores novel approaches in zero-knowledge proofs, focusing on transforming NIZK to ZAPs with inefficient provers. Discusses implications for cryptographic assumptions and fine-grained complexity settings.
Efficient Zero-Knowledge Proofs: A Modular Approach
Explore modular techniques for creating efficient zero-knowledge proofs, focusing on probabilistically checkable and interactive proof systems in cryptography.
Zero Knowledge from the Discrete Logarithm Problem
Explore zero-knowledge proofs, focusing on the discrete logarithm problem. Learn about range proofs, polynomial commitments, and R1CS representation in this advanced cryptography lecture.
ITC Conference - Line Point Zero Knowledge and Its Applications
Explore line-point zero knowledge proofs, their efficiency in arithmetic circuit satisfiability, and applications in non-interactive secure computation and vector oblivious linear evaluation.
On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs
Explore randomness complexity in interactive and statistical zero-knowledge proofs, focusing on reducing verifier's random bits and achieving tradeoffs in SZK protocols.
Steganography: Techniques for Hiding Information in Digital Media
Explore hidden message techniques, file carving, and covert channels in this comprehensive overview of steganography methods and applications.