Paul G. Allen School Courses

Better Ways to Measure and Move - Joint Optimization of Agent's Physical Design and Computational Reasoning

Explore joint optimization of physical design and computational reasoning for intelligent agents, enhancing sensor networks, legged robots, and soft robotics through machine learning techniques.

• YouTube
• 1 hour
• Self-Paced
• Free Video

Assistive Autonomy Revisited - Brenna Argall, Northwestern University

Exploring robotics autonomy to enhance human independence for those with motor impairments. Discusses challenges, research, and innovative approaches in assistive technology and rehabilitation robotics.

• YouTube
• 52 minutes
• Self-Paced
• Free Video

Robots That Talk and Learn - Shiwali Mohan, Palo Alto Research Center

Explore interactive task learning for robots, focusing on designing collaborative human-AI systems. Discover advances in enabling robots to learn new tasks through natural interactions with humans.

• YouTube
• 59 minutes
• Self-Paced
• Free Video

On the Complexity of Anonymous Communication Through Public Networks

Explores onion routing for anonymous online communication, presenting a novel protocol that achieves fault-tolerance, efficiency, and anonymity against active adversaries observing network traffic.

• YouTube
• 22 minutes
• Self-Paced
• Free Video

More Communication Lower Bounds for Information-Theoretic MPC

Explores communication complexity lower bounds in information-theoretic secure multiparty computation, covering perfect passive and malicious security settings with various party thresholds and reactive functionalities.

• YouTube
• 22 minutes
• Self-Paced
• Free Video

2021 ITC Conference- Online Linear Extractors for Independent Sources

Explore online linear extractors for independent sources, focusing on key components of Windows 10's RNG design and examining the effectiveness of rotation as an extractor and condenser.

• YouTube
• 23 minutes
• Self-Paced
• Free Video

Replacing Probability Distributions in Security Games via Hellinger Distance

Explore statistical distance in security games, focusing on Hellinger distance as an alternative to max-log for bit security frameworks and leftover hash lemma applications.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Hashing Five Inputs with Three Compression Calls

Innovative hashing technique using three compression calls for five inputs, offering improved efficiency and security for Merkle-Damgård hashing and Merkle trees with potential applications in cryptography.

• YouTube
• 22 minutes
• Self-Paced
• Free Video

2021 ITC Conference - Code Offset in the Exponent

Explore novel fuzzy extractor construction using error-correcting codes and cryptographic groups, supporting MIPURS distributions for enhanced biometric authentication security.

• YouTube
• 23 minutes
• Self-Paced
• Free Video

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.

• YouTube
• 24 minutes
• Self-Paced
• Free Video

ITC Conference: P4-Free Partition and Cover Numbers & Applications

Explore P4-free partition and cover numbers in graph theory, their applications in cryptography, and connections to communication complexity and randomness extraction.

• YouTube
• 24 minutes
• Self-Paced
• Free Video

2021 ITC Conference - Doubly-Affine Extractors, and Their Applications

Explores doubly-affine extractors for efficient information-theoretic encryption, proposing solutions with large keys and a novel architecture for outsourcing key storage to semi-trusted servers.

• YouTube
• 30 minutes
• Self-Paced
• Free Video

On the Security of Proofs of Sequential Work in a Post-Quantum World

Explores security of Proofs of Sequential Work in post-quantum settings, analyzing constructions, research questions, and formal proofs for cryptographic applications.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

Explore the relationship between private-coin and public-coin interactive proofs, focusing on efficiency-preserving transformations and their implications for cryptographic assumptions and protocol design.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

Quantum-Access Security of the Winternitz One-Time Signature Scheme

Explore quantum-access security of Winternitz one-time signatures, analyzing hash chains in the quantum random oracle model and discussing blind-unforgeability for enhanced post-quantum cryptographic security.

• YouTube
• 25 minutes
• Self-Paced
• Free Video