11 citations · 12 across the 3 of their papers we have counts for
Showing cs.CRShow all
3 papers · 1 filter
cs.CR2018★ 1 cited
Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves
Dan Boneh, Darren Glass, Daniel Krashen +5
We describe a framework for constructing an efficient non-interactive key exchange (NIKE) protocol for n parties for any n >= 2. Our approach is based on the problem of computing i…
cs.CR2016
Elliptic Curve Multiset Hash
Jeremy Maitin-Shepard, Mehdi Tibouchi, Diego Aranha
A homomorphic, or incremental, multiset hash function, associates a hash value to arbitrary collections of objects (with possible repetitions) in such a way that the hash of the un…
cs.CR2014★ 11 cited
Close to Uniform Prime Number Generation With Fewer Random Bits
Pierre-Alain Fouque, Mehdi Tibouchi
In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime less than , the basic idea is to fix a…