Abstract
Input-Indistinguishable Computation
Alon Rosen
Harvard University
I will present a new definition for secure two-party
computation that witout truted set-up:
1) handles an arbitrary number of concurrent executions; and
2) is implementable based on standard complexity assumptions.
In contrast to previous definitions of secure computation,
ours is not siulation-based.
Joint work with Silvio Micali and Rafael Pass.
computation that witout truted set-up:
1) handles an arbitrary number of concurrent executions; and
2) is implementable based on standard complexity assumptions.
In contrast to previous definitions of secure computation,
ours is not siulation-based.
Joint work with Silvio Micali and Rafael Pass.
No video available