SwePub
Sök i LIBRIS databas

  Utökad sökning

id:"swepub:oai:research.chalmers.se:5602b2ee-871f-402f-b863-38ce8206dcb5"
 

Sökning: id:"swepub:oai:research.chalmers.se:5602b2ee-871f-402f-b863-38ce8206dcb5" > Practical and Prova...

Practical and Provably Secure Distributed Aggregation: Verifiable Additive Homomorphic Secret Sharing

Tsaloli, Georgia, 1993 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Souza Banegas, Gustavo, 1988 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Mitrokotsa, Aikaterini, 1978 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
 (creator_code:org_t)
2020-09-21
2020
Engelska.
Ingår i: Cryptography. - : MDPI AG. - 2410-387X. ; 4:3
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • Often clients (e.g., sensors, organizations) need to outsource joint computations that are based on some joint inputs to external untrusted servers. These computations often rely on the aggregation of data collected from multiple clients, while the clients want to guarantee that the results are correct and, thus, an output that can be publicly verified is required. However, important security and privacy challenges are raised, since clients may hold sensitive information. In this paper, we propose an approach, called verifiable additive homomorphic secret sharing (VAHSS), to achieve practical and provably secure aggregation of data, while allowing for the clients to protect their secret data and providing public verifiability i.e., everyone should be able to verify the correctness of the computed result. We propose three VAHSS constructions by combining an additive homomorphic secret sharing (HSS) scheme, for computing the sum of the clients' secret inputs, and three different methods for achieving public verifiability, namely: (i) homomorphic collision-resistant hash functions; (ii) linear homomorphic signatures; as well as (iii) a threshold RSA signature scheme. In all three constructions, we provide a detailed correctness, security, and verifiability analysis and detailed experimental evaluations. Our results demonstrate the efficiency of our proposed constructions, especially from the client side.

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Annan teknik -- Mediateknik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Other Engineering and Technologies -- Media Engineering (hsv//eng)
NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
NATURVETENSKAP  -- Data- och informationsvetenskap -- Datorseende och robotik (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Vision and Robotics (hsv//eng)

Nyckelord

homomorphic secret sharing
verifiable computation
public verifiability
function secret sharing

Publikations- och innehållstyp

art (ämneskategori)
ref (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy