Ran Canetti
YOU?
Author Swipe
View article: Circuit complexity and functionality: A statistical thermodynamics perspective
Circuit complexity and functionality: A statistical thermodynamics perspective Open
Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational proble…
View article: Circuit complexity and functionality: a thermodynamic perspective
Circuit complexity and functionality: a thermodynamic perspective Open
Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be itself a hard problem [1]. …
View article: Circuit complexity and functionality: a thermodynamic perspective
Circuit complexity and functionality: a thermodynamic perspective Open
Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational proble…
View article: Zero-Knowledge Mechanisms
Zero-Knowledge Mechanisms Open
A powerful feature in mechanism design is the ability to irrevocably commit to the rules of a mechanism. Commitment is achieved by public declaration, which enables players to verify incentive properties in advance and the outcome in retro…
View article: On the Computational Hardness Needed for Quantum Cryptography
On the Computational Hardness Needed for Quantum Cryptography Open
In the classical model of computation, it is well established that one-way functions (OWF) are minimal for computational cryptography: They are essential for almost any cryptographic application that cannot be realized with respect to comp…
View article: Automated Exposure Notification for COVID-19.
Automated Exposure Notification for COVID-19. Open
In the current COVID-19 pandemic, various Automated Exposure Notification (AEN) systems have been proposed to help quickly identify potential contacts of infected individuals. All these systems try to leverage the current understanding of …
View article: Using Zero-Knowledge to Reconcile Law Enforcement Secrecy and Fair Trial Rights in Criminal Cases
Using Zero-Knowledge to Reconcile Law Enforcement Secrecy and Fair Trial Rights in Criminal Cases Open
The use of hidden investigative software to collect evidence of crimes presents courts with a recurring dilemma: On the one hand, there is often clear public interest in keeping the software hidden to preserve its effectiveness in fighting…
View article: Verification Dilemmas in Law and the Promise of Zero-Knowledge Proofs
Verification Dilemmas in Law and the Promise of Zero-Knowledge Proofs Open
Individuals who wish to access a website or qualify for a loan are expected to expose personally identifying information, undermining their privacy and security. Firms share proprietary information in dealmaking negotiations which, if the …
View article: Anonymous Collocation Discovery:Taming the Coronavirus While Preserving Privacy
Anonymous Collocation Discovery:Taming the Coronavirus While Preserving Privacy Open
Successful containment of the Coronavirus pandemic rests on the ability to quickly and reliably identify those who have been in close proximity to a contagious individual. Existing tools for doing so rely on the collection of exact locatio…
View article: Anonymous Collocation Discovery: Harnessing Privacy to Tame the Coronavirus
Anonymous Collocation Discovery: Harnessing Privacy to Tame the Coronavirus Open
Successful containment of the Coronavirus pandemic rests on the ability to quickly and reliably identify those who have been in close proximity to a contagious individual. Existing tools for doing so rely on the collection of exact locatio…
View article: Using Universal Composition to Design and Analyze Secure Complex Hardware Systems
Using Universal Composition to Design and Analyze Secure Complex Hardware Systems Open
Modern hardware typically is characterized by a multitude of interacting physical components and software mechanisms. To address this complexity, security analysis should be modular: We would like to formulate and prove security properties…
View article: On the Universally Composable Security of OpenStack
On the Universally Composable Security of OpenStack Open
OpenStack is the prevalent open-source, non-proprietary package for managing cloud services and data centers. It is highly complex and consists of multiple inter-related components which are developed by separate, loosely coordinated group…
View article: EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security
EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security Open
We present a methodology for using the EasyCrypt proof assistant (originally designed for mechanizing the generation of proofs of game-based security of cryptographic schemes and protocols) to mechanize proofs of security of cryptographic …
View article: From Soft Classifiers to Hard Decisions
From Soft Classifiers to Hard Decisions Open
A popular methodology for building binary decision-making classifiers in the presence of imperfect information is to first construct a calibrated non-binary "scoring" classifier, and then to post-process this score to obtain a binary decis…
View article: From Soft Classifiers to Hard Decisions: How fair can we be?
From Soft Classifiers to Hard Decisions: How fair can we be? Open
A popular methodology for building binary decision-making classifiers in the presence of imperfect information is to first construct a non-binary "scoring" classifier that is calibrated over all protected groups, and then to post-process t…
View article: Fully Succinct Garbled RAM
Fully Succinct Garbled RAM Open
We construct the first fully succinct garbling scheme for RAM programs, assuming the existence of indistinguishability obfuscation for circuits and one-way functions. That is, the size, space requirements, and runtime of the garbled progra…