scholarly journals Modes of Operation Suitable for Computing on Encrypted Data

2017 ◽  
pp. 294-324 ◽  
Author(s):  
Dragos Rotaru ◽  
Nigel P. Smart ◽  
Martijn Stam
Keyword(s):  
Finite Field ◽  
Secret Sharing ◽  
Use Case ◽  
Multiparty Computation ◽  
Authenticated Encryption ◽  
Modes Of Operation ◽  
Encrypted Data ◽  
Security Proofs ◽  
Carry Over

We examine how two parallel modes of operation for Authenticated Encryption (namely CTR+PMAC and OTR mode) work when evaluated in a multiparty computation engine. These two modes are selected because they suit the PRFs examined in previous works. In particular the modes are highly parallel, and do not require evaluation of the inverse of the underlying PRF. In order to use these modes one needs to convert them from their original instantiation of being defined on binary blocks of data, to working on elememts in a large prime finite field. The latter fitting the use case of many secret-sharing based MPC engines. In doing this conversion we examine the associated security proofs of PMAC and OTR, and show that they carry over to this new setting.

scholarly journals Two-Cloud-Servers-Assisted Secure Outsourcing Multiparty Computation

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yi Sun ◽  
Qiaoyan Wen ◽  
Yudong Zhang ◽  
Hua Zhang ◽  
Zhengping Jin ◽  
...  
Keyword(s):  
Main Idea ◽  
Multiparty Computation ◽  
Encrypted Data ◽  
Secure Outsourcing ◽  
Outsourced Data ◽  
Custom Made ◽  
Public Keys ◽  
Cloud Servers

We focus on how to securely outsource computation task to the cloud and propose a secure outsourcing multiparty computation protocol on lattice-based encrypted data in two-cloud-servers scenario. Our main idea is to transform the outsourced data respectively encrypted by different users’ public keys to the ones that are encrypted by the same two private keys of the two assisted servers so that it is feasible to operate on the transformed ciphertexts to compute an encrypted result following the function to be computed. In order to keep the privacy of the result, the two servers cooperatively produce a custom-made result for each user that is authorized to get the result so that all authorized users can recover the desired result while other unauthorized ones including the two servers cannot. Compared with previous research, our protocol is completely noninteractive between any users, and both of the computation and the communication complexities of each user in our solution are independent of the computing function.

scholarly journals Cryptosystems using an improving hiding technique based on latin square and magic square

2020 ◽  
Vol 20 (1) ◽  
pp. 510
Author(s):  
Sahab Dheyaa Mohammed ◽  
Taha Mohammed Hasan
Keyword(s):  
Finite Field ◽  
Latin Square ◽  
Sensitive Data ◽  
Avalanche Effect ◽  
Magic Squares ◽  
P Values ◽  
Encrypted Data ◽  
Magic Square ◽  
Encryption Method ◽  
Randomness Tests

<p>Hackers should be prevented from disclosing sensitive data when sent from one device to another over the network. Therefore, the proposed method was established to prevent the attackers from exploiting the vulnerabilities of the redundancy in the ciphertext and enhances the substitution and permutation operations of the encryption process .the solution was performed by eliminates these duplicates by hiding the ciphertext into a submatrix 4 x4 that chooses randomly from magic square 16x16 in each ciphering process. Two techniques of encrypted and hiding were executed in the encryption stage by using a magic square size 3 × 3   and Latin square size 3 × 3 to providing more permutation and also to ensure an inverse matrix of decryption operation be available. In the hiding stage, the ciphertext was hidden into a 16×16 matrix that includes 16 sub-magic squares to eliminate the duplicates in the ciphertext. Where all elements that uses were polynomial numbers of a finite field of degree Galois Fields GF ( ).  The proposed technique is robust against disclosing the repetition encrypted data based on the result of Avalanche Effect in an accepted ratio (62%) and the results of the output of the proposed encryption method have acceptable randomness based on the results of the p-values (0.629515) of the National Institute of Standards and Technology (NIST) randomness tests. The work can be considered significant in the field of encrypting databases because the repetition of encrypted data inside databases is considered an important vulnerability that helps to guess the plaintext from the encrypted text.</p>

Secure Multiparty Computation and Secret Sharing

2015 ◽  
Author(s):  
Ronald Cramer ◽  
Ivan Bjerre Damgard ◽  
Jesper Buus Nielsen
Keyword(s):  
Secret Sharing ◽  
Secure Multiparty Computation ◽  
Multiparty Computation

Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation

2013 ◽  
Vol 28 (1) ◽  
pp. 49-109 ◽  
Author(s):  
Arpita Patra ◽  
Ashish Choudhury ◽  
C. Pandu Rangan
Keyword(s):  
Secret Sharing ◽  
Multiparty Computation ◽  
Verifiable Secret Sharing
Sign in / Sign up

Export Citation Format

Share Document