3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.LO2012
Decorated proofs for computational effects: Exceptions
Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse +1
We define a proof system for exceptions which is close to the syntax for exceptions, in the sense that the exceptions do not appear explicitly in the type of any expression. This p…
cs.CR2010★ 3 cited
Benaloh's Dense Probabilistic Encryption Revisited
Laurent Fousse, Pascal Lafourcade, Mohamed Alnuaimi
In 1994, Josh Benaloh proposed a probabilistic homomorphic encryption scheme, enhancing the poor expansion factor provided by Goldwasser and Micali's scheme. Since then, numerous p…