Upgrade 2020: CIS LAB Speakers
Professor, Applied Cryptography and Computer Security, Stanford University
Comparing Two Approaches to Updatable Encryption: Lattice vs. Symmetric
Professor, Computer Science, UCLA
Sound Crypto Assumptions Prove Existence of Indistinguishability Obfuscation
Professor, Computer Science, Boston University
Ran Canetti Provides Proof of Fully Deniable Encryption and Computation
A New Approach for Computing Attribute Weighted Sums over Encrypted Data
For example, say you want to find individuals over the age of 40 in the state of Wisconsin who watch Fox News, he said. This group could be represented by the predicate f to the public value xi. Now suppose you want to find the folks in group f who responded in a certain way to the poll, zi.
Professor, Cornell and Carnegie Mellon University
Breaking the Speed-of-Light Barrier of Sorting Circuits
But in her talk at the NTT Research Summit, Dr. Elaine Shi describes how to construct sorting circuits that overcome the n log n barrier for short keys.
A New Take on Big-Key Encryption and Incompressible Encodings: Using Useful Data
Fujitsu Labs of America
Arnab Roy Presents a More Efficient Approach to NIZK: Quasi Adaptive
SPARK: A Proposal for Parallelizing Complex Computational Proofs
Computational proofs have become increasingly important over the years, due to our highly networked world where you might want to “outsource” parts of your own computational work to cloud vendors. To illustrate the problem, imagine you want to calculate Pi to 5,000,000 digits, then use the result of this calculation in your own software to calculate something else. As a caveat, imagine if you have an error in your Pi calculation, your resulting calculation will become useless.