Reusable Non-Interactive Secure Computation

ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT III, pp. 462-488, 2019.

Cited by: 8|Bibtex|Views1399|Links
EI

Abstract:

We consider the problem of Non-Interactive Two-Party Secure Computation (NISC), where Rachel wishes to publish an encryption of her input x, in such a way that any other party, who holds an input y, can send her a single message which conveys to her the value f(x, y), and nothing more. We demand security against malicious parties. While s...More

Code:

Data:

Your rating :
0

 

Tags
Comments