• Publications
  • Influence
An Atlas of Legendrian Knots
We present an atlas of Legendrian knots in standard contact three-space. This gives a conjectural Legendrian classification for all knots with arc index at most 9, including alternating knots throughExpand
  • 35
  • 9
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults
The vast majority of works on secure multi-party computation (MPC) assume a full communication pattern: every party exchanges messages with all the network participants over a complete network ofExpand
  • 20
  • 1
Architectural Implications of Nanoscale-Integrated Sensing and Computing
The authors explore nanoscale sensor processor (nSP) architectures. Their design includes a simple accumulator-based instruction-set architecture, sensors, limited memory, and instruction-fusedExpand
  • 20
Circuit-Private Multi-key FHE
Multi-key fully homomorphic encryption MFHE schemes allow polynomially many users without trusted setup assumptions to send their data encrypted under different FHE keys chosen by users independentlyExpand
  • 7
Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality
Secure multi-party computation (MPC) has been thoroughly studied over the past decades. The vast majority of works assume a full communication pattern: every party exchanges messages with all theExpand
  • 5
Resettably-Sound Resettable Zero Knowledge in Constant Rounds
In FOCS 2001 Barak et al. conjectured the existence of zero-knowledge arguments that remain secure against resetting provers and resetting verifiers. The conjecture was proven true by Deng et al. inExpand
  • 3
Information-Theoretic Broadcast with Dishonest Majority for Long Messages
Byzantine broadcast is a fundamental primitive for secure computation. In a setting with n parties in the presence of an adversary controlling at most t parties, while a lot of progress in optimizingExpand
  • 3
Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model
In this work we introduce the corruptible token model. This model generalizes the stateless tamper-proof token model introduced by Katz (EUROCRYPT ’07) and relaxes the trust assumption. Our improvedExpand
  • 2
Universally Composable Secure Computation with Corrupted Tokens
We introduce the corrupted token model. This model generalizes the tamper-proof token model proposed by Katz (EUROCRYPT ’07) relaxing the trust assumption on the honest behavior of tokens. Our modelExpand
  • 1
Classification of Legendrian Knots and Links
The aim of this paper is to use computer program to generate and classify Legendrian knots and links. Modifying the algorithm in [11], we write a program in Java to generate all grid diagrams of upExpand
  • 1