DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Ronald Fagin
Ronald Fagin
Securely Obfuscating Re-Encryption
The Gödel Prize 2020 - Call for Nominatonn
Obfuscating Compute-And-Compare Programs Under LWE
October 1983 Table of Contents
Exploring Differential Obliviousness∗
The Gödel Prize 2019 - Call for Nominations Deadline: February 15, 2019
SIGACT News Complexity Theory Column 74
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes ?
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data∗
A Formula for Incorporating Weights Into Scoring Rules (
Program of the Thirty-Second Annual ACM Symposium on Theory of Computing
Ronald Fagin
Black-Box Circular-Secure Encryption Beyond Affine Functions
Contents U U U
Research Statement
Ron Fagin Speaks out on His Trajectory As a Database Theoretician
Novel Frameworks for Mining Heterogeneous and Dynamic
Replacing Probability Distributions in Security Games Via Hellinger Distance
Top View
STOC 2005 Program Committee Selected Two Award Papers
G¨Odel Prize 2016
Chicago Journal of Theoretical Computer Science MIT Press
A Celebration of the Work of Stephen Cook May 6-9, 2019 • the Fields Institutemay 6-10, 2019 Fields Institute
A Survey of Leakage-Resilient Cryptography∗
Program of the Thirty-Second Annual ACM Symposium on Theory of Computing
Association for Computing Machinery 2 Penn Plaza, Suite 701, New York
John Von Neumann
Comparing Information Without Leaking It
Scrambling Adversarial Errors Using Few Random Bits, Optimal Information Reconciliation, and Better Private Codes 1 Introduction
Efficient Distributed Coin-Tossing Protocols
A Note on Perfect Correctness by Derandomization∗
Comparing Information Without Leaking It
Chicago Journal of Theoretical Computer Science MIT Press
Satisfiability Coding Lemma