Secure Conflict-free Replicated Data Types

被引:4
|
作者
Barbosa, Manuel [1 ,2 ]
Ferreira, Bernardo [3 ,4 ]
Marques, Joao [5 ,6 ]
Portela, Bernardo [1 ,6 ]
Preguica, Nuno [5 ,6 ]
机构
[1] DCC FC UP, Porto, Portugal
[2] INESC TEC, Porto, Portugal
[3] DI FC UL, Lisbon, Portugal
[4] LASIGE, Lisbon, Portugal
[5] DI FCT UNL, Lisbon, Portugal
[6] NOVA LINCS, Costa Da Caparica, Portugal
关键词
Distributed Systems; Cloud Computing; Security;
D O I
10.1145/3427796.3427831
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Conflict-free Replicated Data Types (CRDTs) are abstract data types that support developers when designing and reasoning about distributed systems with eventual consistency guarantees. In their core they solve the problem of how to deal with concurrent operations, in a way that is transparent for developers. However in the real world, distributed systems also suffer from other relevant problems, including security and privacy issues and especially when participants can be untrusted. In this paper we present new privacy-preserving CRDT protocols that can be used to help secure distributed cloud-backed applications, including NoSQL geo-replicated databases. Our proposals are based on standard CRDTs, such as sets and counters, augmented with cryptographic mechanisms that allow their operations to be performed on encrypted data. We accompany our proposals with formal security proofs and implement and integrate them in An-tidoteDB, a geo-replicated NoSQL database that leverages CRDTs for its operations. Experimental evaluations based on the Danish Shared Medication Record dataset (FMK) exhibit the tradeoffs that our different proposals make and show that they are ready to be used in practical applications.
引用
下载
收藏
页码:6 / 15
页数:10
相关论文
共 50 条
  • [31] Mappings for conflict-free access of paths in elementary data structures
    Bertossi, AA
    Pinotti, MC
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 351 - 361
  • [32] The conflict-free Reduction Geometry
    Khasidashvili, Z
    Glauert, J
    THEORETICAL COMPUTER SCIENCE, 2005, 347 (03) : 465 - 497
  • [33] Conflict-free colouring of graphs
    1600, Cambridge University Press (23):
  • [34] CONFLICT-FREE COLORING OF GRAPHS
    Abel, Zachary
    Alvarez, Victor
    Demaine, Erik D.
    Fekete, Sandor P.
    Gour, Aman
    Hesterberg, Adam
    Keldenich, Phillip
    Scheffer, Christian
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (04) : 2675 - 2702
  • [35] Conflict-free colouring of graphs
    1600, Cambridge University Press (23):
  • [36] Conflict-Free Colouring of Subsets
    Jartoux, Bruno
    Keller, Chaya
    Smorodinsky, Shakhar
    Yuditsky, Yelena
    DISCRETE & COMPUTATIONAL GEOMETRY, 2023, 72 (2) : 876 - 891
  • [37] Conflict-Free Colouring of Graphs
    Glebov, Roman
    Szabo, Tibor
    Tardos, Gabor
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (03): : 434 - 448
  • [38] Conflict-free connection of trees
    Chang, Hong
    Ji, Meng
    Li, Xueliang
    Zhang, Jingshu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 42 (03) : 340 - 353
  • [39] Strong conflict-free connection of graphs
    Ji, Meng
    Li, Xueliang
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 364
  • [40] Conflict-Free Evacuation Route Planner
    Herschelman, Roxana
    Yang, KwangSoo
    27TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2019), 2019, : 480 - 483