Highlights
Microsoft unveils Majorana 1, the world’s first quantum processor powered by topological qubits
After 20 Years, Math Couple Solves Major Group Theory Problem
The road to Post-Quantum Ethereum transaction is paved with Account Abstraction (AA)
NTT as PostQuantum and Starks settlements helper precompile
Latticefold and lattice-based operations performance report
Introducing bugs.zksecurity.xyz a knowledge base for ZK bugs
Introduction to Programmable Cryptography Workbook
This is 0xPARC's Introduction to Programmable Cryptography workbook. Its main objective is to help readers follow the book and its concepts. The Jupyter Notebooks directly translate the algorithms and examples mentioned in the book, written in the most straightforward manner possible (i.e., no optimizations).
Updates
AIR-ICICLE : Plonky3 on ICICLE, (part 1)
ICICLE V3.5: Sumcheck with Lambda Functions
Papers
“Check-Before-you-Solve”: Verifiable Time-lock Puzzles
Merkle Mountain Ranges are Optimal: On witness update frequency for cryptographic accumulators
Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC
Diamond iO: A Straightforward Construction of Indistinguishability Obfuscation from Lattices
On the Power of Polynomial Preprocessing: Proving Computations in Sublinear Time, and More
Robust Non-Interactive Zero-Knowledge Combiners
LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems
The Round Complexity of Black-Box Post-Quantum Secure Computation
Verifiable Streaming Computation and Step-by-Step Zero-Knowledge
TFHE Gets Real: an Efficient and Flexible Homomorphic Floating-Point Arithmetic
Error-Simulatable Sanitization for TFHE and Applications
Transistor: a TFHE-friendly Stream Cipher
Improved Resultant Attack against Arithmetization-Oriented Primitives
HasteBoots: Proving FHE Bootstrapping in Seconds
Transparent SNARKs over Galois Rings
Dazzle: Improved Adaptive Threshold Signatures from DDH
Context-Dependent Threshold Decryption and its Applications
Verifiable Computation for Approximate Homomorphic Encryption Schemes
How to Securely Implement Cryptography in Deep Neural Networks
Dynamic Decentralized Functional Encryption: Generic Constructions with Strong Security
Neo: Lattice-based folding scheme for CCS over small fields and pay-per-bit commitments
DFS: Delegation-friendly zkSNARK and Private Delegation of Provers
Practical Zero-Trust Threshold Signatures in Large-Scale Dynamic Asynchronous Networks
FHE-SNARK vs. SNARK-FHE: From Analysis to Practical Verifiable Computation
Lattice-based Cryptography: A survey on the security of the lattice-based NIST finalists
Dimensional eROSion: Improving the ROS Attack with Decomposition in Higher Bases
Quasi-Linear Indistinguishability Obfuscation via Mathematical Proofs of Equivalence and Applications
Non-Interactive Key Exchange: New Notions, New Constructions, and Forward Security
Malleable SNARKs and Their Applications
Traceable Verifiable Random Functions
Lattice-based Sigma-Protocols for Polynomial Relations with Standard Soundness
Zinc: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers
Traceable Verifiable Secret Sharing and Applications
**If you’d like to receive updates via email, subscribe us!