
Explores the characterization of one-way functions through worst-case hardness assumptions, linking NP-hardness and distributional Kolmogorov complexity to cryptographic foundations.

Explore the Recurrent Memory Transformer technique for scaling transformers to process 1 million tokens, examining its strengths, weaknesses, and potential impact on long-term dependency handling in NLP tasks.

Explore efficient methods for transforming interactive protocols into NP-type verifiers, using targeted pseudorandom generators and complexity-theoretic assumptions.

Explores construction of SNARGs for monotone policy batch NP languages under LWE assumption, introducing predicate-extractable hash families as a novel approach beyond non-signaling PCPs.

Explore the cryptographic implications of correlated sampling, examining minimal complexity assumptions and their impact on secure communication systems.

Explores the relationship between incompressible distributions and next-block pseudoentropy, advancing understanding of computational entropy and its implications for cryptographic hardness assumptions.

Explore the intersection of cryptography and Kolmogorov complexity, examining minimal complexity assumptions and their implications for secure communication systems.

Explore constant-round argument systems for log-space uniform circuits, achieving almost-linear verification time using only one-way functions, advancing cryptographic protocol efficiency.

Explore key assumptions in cryptography and complexity theory through an expert panel discussion, delving into minimal complexity requirements for cryptographic systems.

Exploring connections between Indistinguishability Obfuscation and Minimum Circuit Size Problem, revealing implications for cryptography and computational complexity theory.

Explore minimal complexity assumptions in cryptography, focusing on fine-grained approaches that provide strong guarantees against restricted adversarial classes.

Explores limitations and cryptographic requirements for distributed differential privacy in two-party functions like inner product and Hamming distance, with implications for data analysis and privacy.

Explore how computational limitations and cryptographic tools can bypass impossibility results in communication complexity and streaming, with examples and open problems discussed.

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.

Explores unstructured hard languages in NP ∩ coNP, providing evidence for their existence and introducing a new NIZK proof construction, advancing understanding of computational complexity and cryptography.

Explore the concept of universal arguments and their construction for non-deterministic computations, focusing on recent developments in non-interactive succinct arguments and their universality.

Explore fully-local SSB hash families and their applications in cryptography, including multi-hop aggregate signatures and incrementally verifiable computation.

Explore groundbreaking constructions of SNARGs and correlation-intractable hash functions based on sub-exponential DDH, achieving poly-logarithmic proof sizes for Batch-NP and P.

Explore minimal complexity assumptions in cryptography, focusing on proof systems and their applications in secure computation and blockchain technology.

Explore the fascinating intersection of theoretical computer science, art, and cinema with Pixar co-founder Alvy Ray Smith, tracing the evolution from pixels to digital movies and its impact on modern computer graphics.

Explores polynomial-time classical algorithm for noisy random circuit sampling, challenging quantum supremacy claims. Discusses computational complexity, experimental implications, and recent progress in quantum computing.