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 条
  • [41] Priority conflict-free Petri nets
    Hsu-Chun Yen
    Acta Informatica, 1998, 35 : 673 - 688
  • [42] Priority conflict-free Petri nets
    Yen, HC
    ACTA INFORMATICA, 1998, 35 (08) : 673 - 688
  • [43] Complexity of conflict-free colorings of graphs
    Gargano, Luisa
    Rescigno, Adele A.
    THEORETICAL COMPUTER SCIENCE, 2015, 566 : 39 - 49
  • [44] CONFLICT-FREE COLORINGS OF SHALLOW DISCS
    Alon, Noga
    Smorodinsky, Shakhar
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2008, 18 (06) : 599 - 604
  • [45] Separability in conflict-free Petri nets
    Best, Eike
    Esparza, Javier
    Wimmel, Harro
    Wolf, Karsten
    PERSPECTIVES OF SYSTEMS INFORMATICS, 2007, 4378 : 1 - +
  • [46] Online conflict-free coloring of intervals
    Abam, M. A.
    Seraji, M. J. Rezaei
    Shadravan, M.
    SCIENTIA IRANICA, 2014, 21 (06) : 2138 - 2141
  • [47] Conflict-Free Coloring of String Graphs
    Chaya Keller
    Alexandre Rok
    Shakhar Smorodinsky
    Discrete & Computational Geometry, 2021, 65 : 1337 - 1372
  • [48] Building Conflict-Free FFT Schedules
    Richardson, Stephen
    Markovic, Dejan
    Danowitz, Andrew
    Brunhaver, John
    Horowitz, Mark
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2015, 62 (04) : 1146 - 1155
  • [49] Dynamic conflict-free colorings in the plane
    de Berg, Mark
    Markovic, Aleksandar
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2019, 78 : 61 - 73
  • [50] Online conflict-free colorings for hypergraphs
    Bar-Noy, Amotz
    Cheilaris, Panagiotis
    Olonetsky, Svetlana
    Smorodinsky, Shakhar
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 219 - +