The Mathematics of Modern Cryptography
2015-07-06..2015-07-10
Berkeley, United States
| title | author | length |
|---|---|---|
| Fully Homomorphic Encryption | Zvika Brakerski | 54m |
Defines a leveled fully homomorphic scheme built from the learning with errors assumption that encodes messages as eigenvalues for a secret approximate… | ||
| Homomorphic Commitments & Signatures | Daniel Wichs | 41m |
Constructs homomorphic signatures for arbitrary circuits (leveled) where certificate size depends on circuit depth but not data size, built from equivocable… | ||
| Attribute-based Encryption for Circuits | Vinod Vaikuntanathan | 54m |
Constructs an attribute‑based encryption scheme from lattices that handles arbitrary Boolean circuits under a sub‑exponential LWE assumption, gives selective… | ||
| Attribute-based and Predicate Encryption | Hoeteck Wee | 37m |
Claim: a construction gives predicate encryption for all circuits under a standard but subexponential LWE assumption, with short ciphertexts and keys and… | ||
| Historical Talk on Lattice-Based Cryptography | Daniele Micciancio | 01h 40m |
Ajtai’s 1996 paper introduces a worst-case to average-case reduction for lattice problems and spawns the SIS/LWE reductions that underpin modern schemes; 1998… | ||
| Cryptography from Ideal Lattices | Damien Stehlé | 01h 08m |
Shows concrete claims and limits: structured matrices cut storage from O(n^2) to nearly linear (example: n in the hundreds, log q≈8), yielding practical… | ||
| Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling – Daniel Dadush | Daniel Dadush | 37m |
Claims an exact CVP algorithm running in 2^n time by sampling from a shifted discrete Gaussian and combining collisions; samples require parameters bounded by… | ||
| Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling – Noah Stephens-Davidowitz | Noah Stephens-Davidowitz | 33m |
Randomized exact-SVP algorithm runs in 2^n time by starting with ~2^n samples from the discrete Gaussian (via GPV), repeatedly pairing vectors grouped by… | ||
| Algebraic Algorithms for LWE | Ludovic Perret | 37m |
Recasts binary-error LWE as m quadratic polynomials over Fq and shows solving by linearization requires about n^2 samples (then Gaussian elimination is… | ||
| Attacks on Ring-LWE | Kristin Lauter | 38m |
Paper shows practical attacks on decision RLWE instances that come from PLWE-style errors when the defining polynomial has a root mod q or a small-order root… | ||
| How Diffie-Hellman Fails in Practice | Nadia Heninger | 01h 13m |
An Internet-wide scan connects to 14.3 million hosts and finds ~40% using mod-p Diffie–Hellman, with about 70,000 distinct primes and 750 groups whose subgroup… | ||
| Arithmetic Cryptography | Benny Applebaum | 01h 03m |
Benny Applebaum, Tel Aviv University
The Mathematics of Modern Cryptography
http://simons.berkeley.edu/talks/benny-applebaum-2015-07-08 | ||
| Time-Lock Puzzles from Randomized Encodings | Nir Bitansky | 32m |
Construction produces time-lock puzzles by outputting a succinct randomized encoding of a tiny program that idles for T steps and then emits the message… | ||
| Output-Compressing Randomized Encodings and Applications | Huijia Lin | 48m |
Defines compact (output-compressing) randomized encoding that encodes a Turing computation in time sublinear in its output and studies two securities… | ||
| Noisy Connections: A Survey of Interactive Coding and Its Borders with Other Topics | Allison Bishop | 01h 09m |
Surveys interactive coding results: Schulman (1992) shows you can tolerate a constant fraction of adversarial bit flips with only a constant communication… | ||
| Non-Malleable Codes in the Split-State Model | Yevgeniy Dodis | 01h 10m |
Yevgeniy Dodis, New York University
The Mathematics of Modern Cryptography
http://simons.berkeley.edu/talks/yevgeniy-dodis-2015-07-09 | ||
| Finding Short Generators of Principal Ideals | Chris Peikert | 36m |
Given a principal ideal presented by a bad basis, the result proves a classical polynomial‑time method to recover the short generator (up to trivial unit… | ||
| Lattices with Symmetry | Alice Silverberg | 44m |
Gives a concrete deterministic polynomial-time algorithm that decides whether a lattice with a fixed finite abelian symmetry group G is G-isomorphic to the… | ||
| Graph-Induced Multilinear Maps from Lattices | Shai Halevi | 54m |
Construction gives multilinear maps built from standard lattice/LWE ingredients that encode secrets as small matrices and lets multiplication only along… | ||
| Multilinear Maps Over the Integers: From Design to Security | Tancrède Lepoint | 01h 16m |
Proposes an integer-based multilinear map (CLT-style) that replaces the public modulus for zero-testing with a fresh random modulus and builds a LLL-based… | ||
| Cryptography via Burnside Groups | Nelly Fazio, Antonio Nicolosi | 01h 10m |
Introduces a concrete crypto assumption: learning homomorphism with noise (LHN) instantiated with Burnside group B_n,3 (exponent 3) into a small B_r (r≈4–5)… | ||
| nothing matches | ||