Comparing computation complexity of generic protocol with operation specific one

Assume we have a cryptographic protocol for secure multi-party computation that supports generic computation.

Let assume the "protocol 1" uses fully homomorphic encryption (FHE) and the overall computation complexity of the protocol is $O(c)$, where $c$ is input size (i.e. number of inputs). So it involves $O(c)$ homomorphic operations.

On the other, we have " protocol 2" designed for specific operation e.g. private set intersection (PSI). Its computation complexity is $O(c)$, but it does not use any FHE.



Question 1: If we use "protocol 1" for PSI, would the computation complexity still be $O(c)$ or it may increase?

Question 2: In general, how do we compare the complexity of the two protocols?

Replay

Category: protocol design Time: 2016-07-29 Views: 0

Related post

iOS development

Android development

Python development

JAVA development

Development language

PHP development

Ruby development

search

Front-end development

Database

development tools

Open Platform

Javascript development

.NET development

cloud computing

server

Copyright (C) avrocks.com, All Rights Reserved.

processed in 0.140 (s). 12 q(s)