Computing multi-party trust privately

Gilboa, Niv; Kopeetsky, Marina

doi:10.1145/1774088.1774401

Cited by 11 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We first describe the MPWP protocol [17], and then we explain modifications made to construct P-MPWP a lighter version of MPWP.…”

Section: From Mpwp To P-mpwpmentioning

confidence: 99%

“…The MPWP protocol [17] is used to securely compute private trust values in an additive reputation system between n players. Each player P i (excepted P 1 , assumed to be the master player) has a private entry v i , and P 1 private entries are weights u i associated to others players.…”

Section: Mpwp Descriptionmentioning

confidence: 99%

“…The complexity bounds of the different protocols developed in this paper are recalled in Table 1. We give the overall volume of communication, from cubic in [17] to quadratic ( § 3) and then linear for DSDP and Y T P-SS. We also give the minimal number of rounds required to exchange this amount of data, as well as if Paillier-like encryption (as opposed to Benaloh-like encryption) can be used within the protocols.…”

Section: Conclusion and Perspectivementioning

confidence: 99%

“…In such cases the underlying homomorphic cryptosystem is quite often that of Paillier [34] or of Benaloh [9,24]. Now, computing a dot product with n players is actually close to the MPWP protocol of [17], computing a mean in a distributed manner: computing dot products is actually similar to computing a weighted average where the weights are in the known row, and the values to be averaged are privately distributed. The original MPWP protocol has to use a Benaloh-like homomorphic encryption.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Dual protocols for private multi-party matrix multiplication and trust computations

Dumas

Lafourcade

Orfila

et al. 2017

Computers & Security

View full text Add to dashboard Cite

This paper deals with distributed matrix multiplication. Each player owns only one row of both matrices and wishes to learn about one distinct row of the product matrix, without revealing its input to the other players. We first improve on a weighted average protocol, in order to securely compute a dot-product with a quadratic volume of communications and linear number of rounds. We also propose two dual protocols with five communication rounds, using a Paillier-like underlying homomorphic public key cryptosystem, which is secure in the semihonest model or secure with high probability in the malicious adversary model. Using cryptographic protocol verification tools, we are able to check the security of both protocols and provide a countermeasure for each attack found by the tools. We also give a generic randomization method to avoid collusion attacks. As an application, we show that this protocol enables a distributed and secure evaluation of trust relationships in a network, for a large class of trust evaluation schemes.

show abstract

“…We first describe the MPWP protocol [17], and then we explain modifications made to construct P-MPWP a lighter version of MPWP.…”

Section: From Mpwp To P-mpwpmentioning

confidence: 99%

Section: Mpwp Descriptionmentioning

confidence: 99%

Section: Conclusion and Perspectivementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Dual protocols for private multi-party matrix multiplication and trust computations

Dumas

Lafourcade

Orfila

et al. 2017

Computers & Security

View full text Add to dashboard Cite

show abstract

“…How to maintain trust, privacy, and evaluation without a trusted authority becomes an important issue. In 2010, Dolev et al showed how multi-users trust each other without the help of trusted authority [1]. Their scheme also significantly reduced the number of message exchanges, and therefore, it is more suitable for real environments.…”

Section: Introductionmentioning

confidence: 99%

Distributed E-Voting and E-Bidding Systems Based on Smart Contract

2019

View full text Add to dashboard Cite

Traditional voting and bidding systems largely rely on paperwork and human resources throughout the voting process, which can incur high costs in terms of both time and money. Electronic voting and electronic bidding systems can be used to reduce costs, and many new systems have been introduced. However, most systems require a powerful and trusted third party to guarantee system integrity and security. With developments in blockchain technology, research has begun to highlight the core concept of decentralization. In this study, we introduce the first decentralized electronic voting and bidding systems based on a blockchain and smart contract. We also use cryptographic techniques such as oblivious transfer and homomorphic encryptions to improve privacy protection. Our proposed systems allow voters and bidders to participate in the opening phase and improve participant anonymity, the privacy of data transmission, and data reliability and verifiability. Moreover, compared with other electronic voting and bidding systems, our systems are safer and more efficient.

show abstract

A novel approach for privacy homomorphism using attribute‐based encryption

Doshi

Jinwala

2016

Security Comm Networks

View full text Add to dashboard Cite

In CRYPTO'13, Gentry et al. proposed the first homomorphic encryption (HE) scheme for the attribute‐based encryption (ABE). However, Gentry's scheme requires the same index for encryption of each ciphertext and supports only the key‐policy ABE. Indeed, in SECRYPT'13, Clear et al. left an open problem in the Gentry et al. scheme viz. a scheme that requires different sets of index in HE using ABE and supports the ciphertext‐policy ABE (CP‐ABE), where the sender is assumed to be intelligent. In addition, in INDOCRYPT'12, Vaikuntanathan discussed an open problem viz. to work out the HE using cryptographic techniques other than lattice‐based cryptography. With an aim to propose the CP‐ABE scheme using HE, in this research attempt, we propose an approach that integrates the benefits of HE in CP‐ABE and yet uses pairing‐based cryptography. In our approach viz. attribute‐based HE (AB‐HE), a user is able to successfully decrypt the ciphertext only if the attributes in the policy match those in the secret key. However, in addition, our approach also allows multiple invocations of multiplication operation on the ciphertext as in a typical partially HE, coupling the advantages of the partial HE in the CP‐ABE. Further, we also propose an extension of the proposed scheme that serves as a pseudo‐fully HE, but requires the help of a key authority. The security of the proposed scheme is based on the decisional bilinear Diffie–Hellman problem. To the best of our knowledge, ours is a unique attempt in integrating HE into the attribute‐based cryptography with different indexes/policies. In addition, our AB‐HE scheme is pairing‐based, and by adding more ciphertexts, it does not blow the final ciphertext size because we use the constant length ciphertext approach for the encryption. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Computing multi-party trust privately

Cited by 11 publications

References 9 publications

Dual protocols for private multi-party matrix multiplication and trust computations

Dual protocols for private multi-party matrix multiplication and trust computations

Distributed E-Voting and E-Bidding Systems Based on Smart Contract

A novel approach for privacy homomorphism using attribute‐based encryption

Contact Info

Product

Resources

About