scholarly journals Generalizing Efficient Multiparty Computation

2015 ◽  
pp. 15-32 ◽  
Author(s):  
Bernardo M. David ◽  
Ryo Nishimaki ◽  
Samuel Ranellucci ◽  
Alain Tapp
Keyword(s):  
Multiparty Computation

Secure multiparty computation solutions of collection member decision

2013 ◽  
Vol 33 (12) ◽  
pp. 3527-3530
Author(s):  
Yongli DOU ◽  
Haichun WANG ◽  
Jian KANG
Keyword(s):  
Secure Multiparty Computation ◽  
Multiparty Computation

scholarly journals An Application of p-Fibonacci Error-Correcting Codes to Cryptography

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 789
Author(s):  
Emanuele Bellini ◽  
Chiara Marcolla ◽  
Nadir Murru
Keyword(s):  
Error Correcting Code ◽  
Error Correcting Codes ◽  
Multiparty Computation ◽  
Zero Knowledge ◽  
Signature Schemes ◽  
Standardization Process ◽  
Technology Standardization

In addition to their usefulness in proving one’s identity electronically, identification protocols based on zero-knowledge proofs allow designing secure cryptographic signature schemes by means of the Fiat–Shamir transform or other similar constructs. This approach has been followed by many cryptographers during the NIST (National Institute of Standards and Technology) standardization process for quantum-resistant signature schemes. NIST candidates include solutions in different settings, such as lattices and multivariate and multiparty computation. While error-correcting codes may also be used, they do not provide very practical parameters, with a few exceptions. In this manuscript, we explored the possibility of using the error-correcting codes proposed by Stakhov in 2006 to design an identification protocol based on zero-knowledge proofs. We showed that this type of code offers a valid alternative in the error-correcting code setting to build such protocols and, consequently, quantum-resistant signature schemes.

scholarly journals Efficient Secure Multiparty Computation Protocol for Sequencing Problem over Insecure Channel

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Yi Sun ◽  
Qiaoyan Wen ◽  
Yudong Zhang ◽  
Hua Zhang ◽  
Zhengping Jin
Keyword(s):  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Secure Multiparty Computation ◽  
Online Auction ◽  
Multiparty Computation ◽  
Sequencing Problem ◽  
The Core ◽  
Secure Protocol ◽  
Core Issue

As a powerful tool in solving privacy preserving cooperative problems, secure multiparty computation is more and more popular in electronic bidding, anonymous voting, and online auction. Privacy preserving sequencing problem which is an essential link is regarded as the core issue in these applications. However, due to the difficulties of solving multiparty privacy preserving sequencing problem, related secure protocol is extremely rare. In order to break this deadlock, this paper first presents an efficient secure multiparty computation protocol for the general privacy-preserving sequencing problem based on symmetric homomorphic encryption. The result is of value not only in theory, but also in practice.

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions

2018 ◽  
pp. 175-205 ◽  
Author(s):  
Fabrice Benhamouda ◽  
Huijia Lin ◽  
Antigoni Polychroniadou ◽  
Muthuramakrishnan Venkitasubramaniam
Keyword(s):  
Secure Multiparty Computation ◽  
Multiparty Computation
Sign in / Sign up

Export Citation Format

Share Document