In the traditional scenario in cryptography there is one sender, one receiver and an active or
passive eavesdropper who is an opponent. Depending from the application the sender or …

We construct a verifiable delay function (VDF). A VDF is a function whose evaluation
requires running a given number of sequential steps, yet the result can be efficiently verified …

A pseudorandom function F:\mathcalK*\mathcalX→\mathcalY is said to be key homomorphic
if given F (k 1, x) and F (k 2, x) there is an efficient algorithm to compute F (k 1⊕ k 2, x) …

In this paper we introduce the concept of privacy preserving data mining. In our model, two
parties owning confidential databases wish to run a data mining algorithm on the union of …

We propose several decentralized ceremonies for constructing a powers-of-tau structured
reference string (SRS). Our protocols make use of a blockchain platform to run in a …

We report on our discovery of an algorithmic flaw in the construction of primes for RSA key
generation in a widely-used library of a major manufacturer of cryptographic hardware. The …

We develop an efficient identity based signature scheme based on pairings whose security
relies on the hardness of the Diffie-Hellman problem in the random oracle model. We …

(57) ABSTRACT A system and method for communicating information between a first party
and a second party, comprising iden tifying desired information, negotiating, through an inter …

In this paper we address the issue of privacy preserving data mining. Specifically, we
consider a scenario in which two parties owning confidential databases wish to run a data …

Cryptology is the practice of hiding digital information by means of various obfuscatory and
steganographic techniques. The application of said techniques facilitates message …