In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realise...
This paper presents an improved protocol for Internet voting that allows recasting of ballots to eliminate voting errors, encourages early voting and provides an opportunity for c...
Abstract. We describe a single framework in which to view the endto-end-independently-verifiable (E2E) polling-place voting systems with a mixnet back-end. We use the framework to ...
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Abstract. Automatic recognition of human faces is becoming increasingly popular in civilian and law enforcement applications that require reliable recognition of humans. However, t...
Ahmad-Reza Sadeghi, Thomas Schneider 0003, Immo We...
Abstract. We give a direct construction of a certificateless key encapsulation mechanism (KEM) in the standard model that is more efficient than the generic constructions proposed ...
Georg Lippold, Colin Boyd, Juan Manuel Gonzá...