Michael Gerbush

Learn More
In this paper, we introduce the abstraction of Dual Form Signatures as a useful framework for proving security (existential unforgeability) from static assumptions for schemes with special structure that are used as a basis of other cryptographic protocols and applications. We demonstrate the power of this framework by proving security under static(More)
We consider the problem of finding minimum reset sequences in synchronizing automata. The well-known Černý conjecture states that every n-state synchronizing automaton has a reset sequence with length at most (n − 1). While this conjecture gives an upper bound on the length of every reset sequence, it does not directly address the problem of finding the(More)
Secure Computation of Face Identification (SCiFI) [20] is a recently developed secure face recognition system that ensures the list of faces it can identify (e.g., a terrorist watch list) remains private. In this work, we study the consequences of malformed input attacks on the system - from both a security and computer vision standpoint. In particular, we(More)
  • 1