Zero Knowledge Proofs for Verifiable Computation on Blockchain Systems - Panel Discussion
Expert panel explores zero knowledge proofs for verifiable computation on blockchain systems, discussing applications, challenges, and future potential in Web3 technologies.
Seamless Services for an Open World
Explore the next generation of open services with verifiable data and computation, enabling seamless, location-free, and privacy-respecting systems that scale superlinearly and interoperate without pre-negotiation.
Boosting Verifiable Computation on Encrypted Data
Explore verifiable computation on encrypted data, covering homomorphic encryption, SNARKs, and polynomial commitments for secure and private delegation of computation.
VRAM: Faster Verifiable RAM With Program-Independent Preprocessing
Explore faster verifiable RAM with program-independent preprocessing, reducing prover's memory and time while scaling to larger computations. Optimal prover overhead and comparable performance to program-specific schemes.
XJsnark - A Framework for Efficient Verifiable Computation
Explore efficient verifiable computation with xJsnark framework. Learn circuit-friendly algorithms, optimizations for integer arithmetic, and techniques to minimize redundant computations in cloud and cryptocurrency applications.
IPVM - Bringing Wasm-Based Edge Compute to IPFS
Explore IPVM and UCAN Invocations: revolutionizing open services with verifiable data and computation, enabling seamless interoperability and superlinear scaling for the next generation of networked systems.
Verifiable Delegation of Computation over Large Datasets - Crypto 2011
Explore efficient verification of computations on large datasets, including high-degree polynomial functions, verifiable keyword search, and proofs of retrievability, based on cryptographic assumptions.
Cinderella - Turning Shabby X.509 Certificates into Elegant Anonymous Credentials with the Magic of Verifiable Computation
Transforming X.509 certificates into anonymous credentials using verifiable computation, enhancing privacy and integrity in authentication for applications like TLS and e-voting.
Verifiable ASICs
Explore verifiable computation for untrusted ASICs, enabling high-assurance execution without compromising performance. Learn about the Zebra system's implementation and its potential to match trusted platform performance.
Verifier-on-a-Leash - New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources
Explore new schemes for verifiable delegated quantum computation, featuring quasilinear resources and enhanced security in this cutting-edge cryptography research presentation.
Polynomial Commitments and SNARKs
Explore advanced cryptographic concepts like polynomial commitments and SNARKs in this comprehensive session from Crypto 2024, chaired by Yupeng Zhang.
SNARKs - Introduction and Fundamentals
Explore cutting-edge developments in SNARKs (Succinct Non-Interactive Arguments of Knowledge) at this Crypto 2024 session, chaired by Nir Bitansky.
SNARKs 2 - Advanced Cryptographic Protocols
Explore advanced cryptographic concepts and latest developments in SNARKs at this Crypto 2024 session, chaired by Jonathan Bootle.