Re:Practical homomorphic encryption over integers (2017)
by AlexCoventry on Tuesday July 24, 2018 @02:02AM
(#17598483)
> One can imagine some combination of the primitives in which you could prove that you added here the same amount you subtracted from there, that neither total is below zero, but for which the number actually transferred is encrypted
You are exactly describing Mimblewimble.
https://github.com/ignopeverell/grin/blob/master/doc/intro.m...