Name
Abstract | ||
|---|---|---|
This paper deals with the use of a minimal model for performing secure computations. The communication is based on a protocol which makes use of disjoint function decomposition and more precisely of minimal ESCT (Exclusive-or Sum of Complex Terms) expressions in order to perform a secure computation. The complexity of this protocol is directly proportional to the size of the ESCT expression in use, which is much smaller in comparison to other proposed minimal models (e. g., ESOP). Moreover, quantum algorithms are discussed that provide significant speedup to the process of producing the ESCT expressions, when compared to conventional ones. Hence, this paper provides a very useful application of the ESCT expressions in the field of cryptographic protocols. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1142/S0218126610006906 | JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS |
Keywords | Field | DocType |
ESCT,simple disjoint decomposition,secure computations,minimization | Secure multi-party computation,Disjoint sets,Minimal models,Expression (mathematics),Cryptographic protocol,Computer science,Functional decomposition,Theoretical computer science,Quantum algorithm,Speedup | Journal |
Volume | Issue | ISSN |
19 | 7 | 0218-1266 |
Citations | PageRank | References |
2 | 0.39 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marinos Sampson | 1 | 11 | 2.22 |
| Dimitrios Voudouris | 2 | 21 | 3.66 |
| George K. Papakonstantinou | 3 | 159 | 61.88 |