1007 lines
91 KiB
BibTeX
1007 lines
91 KiB
BibTeX
@misc{ADatP4774EDAV1,
|
||
title = {{{ADatP-4774 EDA V1 E}}.Pdf},
|
||
file = {/home/alice/Zotero/storage/CDMAWK98/ADatP-4774 EDA V1 E.pdf.pdf}
|
||
}
|
||
|
||
@misc{AixMarseilleUniversiteAuthentication,
|
||
title = {Aix-{{Marseille Universit\'e}} - {{Authentication}}},
|
||
urldate = {2023-11-17},
|
||
howpublished = {https://ident.univ-amu.fr/cas/login?service=https\%3A\%2F\%2Fsesame.univ-amu.fr\%2Flogin\_check},
|
||
file = {/home/alice/Zotero/storage/M3ZKGM8C/login.html}
|
||
}
|
||
|
||
@misc{almeidaBlocklaceUniversalByzantine2024,
|
||
title = {The {{Blocklace}}: {{A Universal}}, {{Byzantine Fault-Tolerant}}, {{Conflict-free Replicated Data Type}}},
|
||
shorttitle = {The {{Blocklace}}},
|
||
author = {Almeida, Paulo S{\'e}rgio and Shapiro, Ehud},
|
||
year = 2024,
|
||
month = feb,
|
||
number = {arXiv:2402.08068},
|
||
eprint = {2402.08068},
|
||
primaryclass = {cs},
|
||
publisher = {arXiv},
|
||
doi = {10.48550/arXiv.2402.08068},
|
||
urldate = {2024-04-12},
|
||
abstract = {Conflict-free Replicated Data Types (CRDTs) are designed for replica convergence without global coordination or consensus. Recent work has achieves the same in a Byzantine environment, through DAG-like structures based on cryptographic hashes of content. The blocklace is a partially-ordered generalization of the blockchain in which each block has any finite number of signed hash pointers to preceding blocks. We show that the blocklace datatype, with the sole operation of adding a single block, is a CRDT: it is both a pure operation-based CRDT, with self-tagging; and a delta-state CRDT, under a slight generalization of the delta framework. Allowing arbitrary values as payload, the blocklace can also be seen as a universal Byzantine fault-tolerant implementation for arbitrary CRDTs, under the operation-based approach. Current approaches only care about CRDT convergence, being equivocation-tolerant (they do not detect or prevent equivocations), allowing a Byzantine node to cause an arbitrary amount of harm by polluting the CRDT state with an infinite number of equivocations. We show that a blocklace can be used not only in an equivocation-tolerant way, but also so as to detect and eventually exclude Byzantine behavior, namely equivocations, even under the presence of collusion. The blocklace CRDT protocol ensures that the Byzantine nodes may harm only a finite prefix of the computation.},
|
||
archiveprefix = {arXiv},
|
||
keywords = {Computer Science - Data Structures and Algorithms,Computer Science - Distributed Parallel and Cluster Computing},
|
||
file = {/home/alice/Zotero/storage/S73ZWXGL/Almeida et Shapiro - 2024 - The Blocklace A Universal, Byzantine Fault-Tolera.pdf;/home/alice/Zotero/storage/J8X5IYE4/2402.html}
|
||
}
|
||
|
||
@misc{appjetEtherpadEasySyncTechnical2011,
|
||
title = {Etherpad and {{EasySync Technical Manua}}},
|
||
author = {AppJet},
|
||
year = 2011,
|
||
urldate = {2023-12-10},
|
||
howpublished = {https://raw.githubusercontent.com/ether/etherpad-lite/master/doc/easysync/easysync-full-description.pdf},
|
||
file = {/home/alice/Zotero/storage/F5SV2JTZ/easysync-full-description.pdf}
|
||
}
|
||
|
||
@book{attiyaDistributedComputingFundamentals2004,
|
||
title = {Distributed {{Computing}}: {{Fundamentals}}, {{Simulations}}, and {{Advanced Topics}}},
|
||
shorttitle = {Distributed {{Computing}}},
|
||
author = {Attiya, Hagit and Welch, Jennifer},
|
||
year = 2004,
|
||
month = mar,
|
||
publisher = {John Wiley \& Sons},
|
||
abstract = {* Comprehensive introduction to the fundamental results in the mathematical foundations of distributed computing * Accompanied by supporting material, such as lecture notes and solutions for selected exercises * Each chapter ends with bibliographical notes and a set of exercises * Covers the fundamental models, issues and techniques, and features some of the more advanced topics},
|
||
googlebooks = {3xfhhRjLUJEC},
|
||
isbn = {978-0-471-45324-6},
|
||
langid = {english},
|
||
keywords = {Computers / Computer Engineering,Computers / Computer Science,Computers / Networking / General}
|
||
}
|
||
|
||
@inproceedings{attiyaSpecificationComplexityCollaborative2016,
|
||
title = {Specification and {{Complexity}} of {{Collaborative Text Editing}}},
|
||
booktitle = {Proceedings of the 2016 {{ACM Symposium}} on {{Principles}} of {{Distributed Computing}}},
|
||
author = {Attiya, Hagit and Burckhardt, Sebastian and Gotsman, Alexey and Morrison, Adam and Yang, Hongseok and Zawirski, Marek},
|
||
year = 2016,
|
||
month = jul,
|
||
pages = {259--268},
|
||
publisher = {ACM},
|
||
address = {Chicago Illinois USA},
|
||
doi = {10.1145/2933057.2933090},
|
||
urldate = {2023-11-20},
|
||
abstract = {Collaborative text editing systems allow users to concurrently edit a shared document, inserting and deleting elements (e.g., characters or lines). There are a number of protocols for collaborative text editing, but so far there has been no precise specification of their desired behavior, and several of these protocols have been shown not to satisfy even basic expectations. This paper provides a precise specification of a replicated list object, which models the core functionality of replicated systems for collaborative text editing. We define a strong list specification, which we prove is implemented by an existing protocol, as well as a weak list specification, which admits additional protocol behaviors.},
|
||
isbn = {978-1-4503-3964-3},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/LFJ3M9JC/Attiya et al. - 2016 - Specification and Complexity of Collaborative Text.pdf}
|
||
}
|
||
|
||
@misc{banoConsensusAgeBlockchains2017,
|
||
title = {Consensus in the {{Age}} of {{Blockchains}}},
|
||
author = {Bano, Shehar and Sonnino, Alberto and {Al-Bassam}, Mustafa and Azouvi, Sarah and McCorry, Patrick and Meiklejohn, Sarah and Danezis, George},
|
||
year = 2017,
|
||
month = nov,
|
||
number = {arXiv:1711.03936},
|
||
eprint = {1711.03936},
|
||
primaryclass = {cs},
|
||
publisher = {arXiv},
|
||
urldate = {2024-01-12},
|
||
abstract = {The blockchain initially gained traction in 2008 as the technology underlying Bitcoin [105], but now has been employed in a diverse range of applications and created a global market worth over \$150B as of 2017. What distinguishes blockchains from traditional distributed databases is the ability to operate in a decentralized setting without relying on a trusted third party. As such their core technical component is consensus: how to reach agreement among a group of nodes. This has been extensively studied already in the distributed systems community for closed systems, but its application to open blockchains has revitalized the field and led to a plethora of new designs.},
|
||
archiveprefix = {arXiv},
|
||
langid = {english},
|
||
keywords = {Computer Science - Cryptography and Security},
|
||
file = {/home/alice/Zotero/storage/2ZCVZA7R/Bano et al. - 2017 - Consensus in the Age of Blockchains.pdf}
|
||
}
|
||
|
||
@article{bayukDatacentricSecurity2009,
|
||
title = {Data-Centric Security},
|
||
author = {Bayuk, Jennifer},
|
||
year = 2009,
|
||
month = mar,
|
||
journal = {Computer Fraud \& Security},
|
||
volume = {2009},
|
||
number = {3},
|
||
pages = {7--11},
|
||
issn = {1361-3723},
|
||
doi = {10.1016/S1361-3723(09)70032-6},
|
||
urldate = {2023-12-08},
|
||
abstract = {The authoritative control objectives for access to data have always been something along the lines of: ``Confirm that user access rights to systems and data are in line with defined and documented business needs, and that job requirements are attached to user identities\dots. Ensure that critical and confidential information is withheld from those who should not have access to it.''1},
|
||
file = {/home/alice/Zotero/storage/2YRZBICQ/Bayuk - 2009 - Data-centric security.pdf;/home/alice/Zotero/storage/KC3F5F86/S1361372309700326.html}
|
||
}
|
||
|
||
@inproceedings{burckhardtReplicatedDataTypes2014,
|
||
title = {Replicated Data Types: Specification, Verification, Optimality},
|
||
shorttitle = {Replicated Data Types},
|
||
booktitle = {Proceedings of the 41st {{ACM SIGPLAN-SIGACT Symposium}} on {{Principles}} of {{Programming Languages}}},
|
||
author = {Burckhardt, Sebastian and Gotsman, Alexey and Yang, Hongseok and Zawirski, Marek},
|
||
year = 2014,
|
||
month = jan,
|
||
pages = {271--284},
|
||
publisher = {ACM},
|
||
address = {San Diego California USA},
|
||
doi = {10.1145/2535838.2535848},
|
||
urldate = {2023-11-17},
|
||
abstract = {Geographically distributed systems often rely on replicated eventually consistent data stores to achieve availability and performance. To resolve conflicting updates at different replicas, researchers and practitioners have proposed specialized consistency protocols, called replicated data types, that implement objects such as registers, counters, sets or lists. Reasoning about replicated data types has however not been on par with comparable work on abstract data types and concurrent data types, lacking specifications, correctness proofs, and optimality results.},
|
||
isbn = {978-1-4503-2544-8},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/B29E2LAA/Burckhardt et al. - 2014 - Replicated data types specification, verification.pdf}
|
||
}
|
||
|
||
@inproceedings{burckhardtReplicatedDataTypes2014a,
|
||
title = {Replicated Data Types: Specification, Verification, Optimality},
|
||
shorttitle = {Replicated Data Types},
|
||
booktitle = {Proceedings of the 41st {{ACM SIGPLAN-SIGACT Symposium}} on {{Principles}} of {{Programming Languages}}},
|
||
author = {Burckhardt, Sebastian and Gotsman, Alexey and Yang, Hongseok and Zawirski, Marek},
|
||
year = 2014,
|
||
month = jan,
|
||
pages = {271--284},
|
||
publisher = {ACM},
|
||
address = {San Diego California USA},
|
||
doi = {10.1145/2535838.2535848},
|
||
urldate = {2023-11-17},
|
||
abstract = {Geographically distributed systems often rely on replicated eventually consistent data stores to achieve availability and performance. To resolve conflicting updates at different replicas, researchers and practitioners have proposed specialized consistency protocols, called replicated data types, that implement objects such as registers, counters, sets or lists. Reasoning about replicated data types has however not been on par with comparable work on abstract data types and concurrent data types, lacking specifications, correctness proofs, and optimality results.},
|
||
isbn = {978-1-4503-2544-8},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/KQNF7XLE/Burckhardt et al. - 2014 - Replicated data types specification, verification.pdf}
|
||
}
|
||
|
||
@article{davisGeneralizingOperationalTransformation,
|
||
title = {Generalizing {{Operational Transformation}} to the {{Standard General Markup Language}}},
|
||
author = {Davis, Aguido Horatio and Sun, Chengzheng and Lu, Junwei},
|
||
abstract = {In this paper we extend operational transformation to support synchronous collaborative editing of documents written in dialects of SGML (Standard General Markup Language) such as XML and HTML, based on SGML's abstract data model, the grove. We argue that concurrent updates to a shared grove must be transformed before being applied to each replica to ensure consistency. We express grove operations as property changes on positionally-addressed nodes, define a set of transformation functions, and show how to apply an existing generic operational transformation algorithm to achieve this. This result makes synchronous group editing applicable to the modern Web.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/9GJ52G8C/Davis et al. - Generalizing Operational Transformation to the Sta.pdf}
|
||
}
|
||
|
||
@article{decandiaDynamoAmazonsHighly2007,
|
||
title = {Dynamo: {{Amazon}}'s {{Highly Available Key-value Store}}},
|
||
author = {DeCandia, Giuseppe and Hastorun, Deniz and Jampani, Madan and Kakulapati, Gunavardhan and Lakshman, Avinash and Pilchin, Alex and Sivasubramanian, Swaminathan and Vosshall, Peter and Vogels, Werner},
|
||
year = 2007,
|
||
abstract = {Reliability at massive scale is one of the biggest challenges we face at Amazon.com, one of the largest e-commerce operations in the world; even the slightest outage has significant financial consequences and impacts customer trust. The Amazon.com platform, which provides services for many web sites worldwide, is implemented on top of an infrastructure of tens of thousands of servers and network components located in many datacenters around the world. At this scale, small and large components fail continuously and the way persistent state is managed in the face of these failures drives the reliability and scalability of the software systems.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/KDHRPBGR/DeCandia et al. - Dynamo Amazon’s Highly Available Key-value Store.pdf}
|
||
}
|
||
|
||
@article{duboisMemoryAccessBuffering1986,
|
||
title = {Memory Access Buffering in Multiprocessors},
|
||
author = {Dubois, M. and Scheurich, C. and Briggs, F.},
|
||
year = 1986,
|
||
month = may,
|
||
journal = {ACM SIGARCH Computer Architecture News},
|
||
volume = {14},
|
||
number = {2},
|
||
pages = {434--442},
|
||
issn = {0163-5964},
|
||
doi = {10.1145/17356.17406},
|
||
urldate = {2024-02-15},
|
||
abstract = {In highly-pipelined machines, instructions and data are prefetched and buffered in both the processor and the cache. This is done to reduce the average memory access latency and to take advantage of memory interleaving. Lock-up free caches are designed to avoid processor blocking on a cache miss. Write buffers are often included in a pipelined machine to avoid processor waiting on writes. In a shared memory multiprocessor, there are more advantages in buffering memory requests, since each memory access has to traverse the memory- processor interconnection and has to compete with memory requests issued by different processors. Buffering, however, can cause logical problems in multiprocessors. These problems are aggravated if each processor has a private memory in which shared writable data may be present, such as in a cache-based system or in a system with a distributed global memory. In this paper, we analyze the benefits and problems associated with the buffering of memory requests in shared memory multiprocessors. We show that the logical problem of buffering is directly related to the problem of synchronization. A simple model is presented to evaluate the performance improvement resulting from buffering.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/VYG4ZHI3/Dubois et al. - 1986 - Memory access buffering in multiprocessors.pdf}
|
||
}
|
||
|
||
@inproceedings{foxHarvestYieldScalable1999,
|
||
title = {Harvest, Yield, and Scalable Tolerant Systems},
|
||
booktitle = {Proceedings of the {{Seventh Workshop}} on {{Hot Topics}} in {{Operating Systems}}},
|
||
author = {Fox, A. and Brewer, E.A.},
|
||
year = 1999,
|
||
pages = {174--178},
|
||
publisher = {IEEE Comput. Soc},
|
||
address = {Rio Rico, AZ, USA},
|
||
doi = {10.1109/HOTOS.1999.798396},
|
||
urldate = {2024-02-15},
|
||
abstract = {The cost of reconciling consistency and state management with high availability is highly magnified by the unprecedented scale and robustness requirements of today's Internet applications. We propose two strategies for improving overall availability using simple mechanisms that scale over large applications whose output behavior tolerates graceful degradation. We characterize this degradation in terms of harvest and yield, and map it directly onto engineering mechanisms that enhance availability by improving fault isolation, and in some cases also simplify programming. By collecting examples of related techniques in the literature and illustrating the surprising range of applications that can benefit from these approaches, we hope to motivate a broader research program in this area.},
|
||
isbn = {978-0-7695-0237-3},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/AZP4JBSZ/Fox and Brewer - 1999 - Harvest, yield, and scalable tolerant systems.pdf}
|
||
}
|
||
|
||
@misc{freyProcessCommutativeDistributedObjects2023,
|
||
title = {Process-{{Commutative Distributed Objects}}: {{From Cryptocurrencies}} to {{Byzantine-Fault-Tolerant CRDTs}}},
|
||
shorttitle = {Process-{{Commutative Distributed Objects}}},
|
||
author = {Frey, Davide and Guillou, Lucie and Raynal, Michel and Ta{\"i}ani, Fran{\c c}ois},
|
||
year = 2023,
|
||
month = nov,
|
||
number = {arXiv:2311.13936},
|
||
eprint = {2311.13936},
|
||
primaryclass = {cs},
|
||
publisher = {arXiv},
|
||
urldate = {2024-01-22},
|
||
abstract = {This paper explores the territory that lies between best-effort Byzantine-Fault-Tolerant Conflict-free Replicated Data Types (BFT CRDTs) and totally ordered distributed ledgers. It formally characterizes a novel class of distributed objects that only requires a First In First Out (FIFO) order on the object operations from each process (taken individually). The formalization relies on Mazurkiewicz traces to define legal sequences of operations and ensure a combination of Strong Eventual Consistency (SEC) and Pipleline Consistency (PC). The paper presents a generic algorithm that implements this novel class of distributed objects both in a crash- and Byzantine setting. Finally, the proposed approach is illustrated with four instances of this class of objects, namely money transfer, Petri nets, multi-sets, and concurrent work stealing dequeues.},
|
||
archiveprefix = {arXiv},
|
||
langid = {english},
|
||
keywords = {Computer Science - Distributed Parallel and Cluster Computing},
|
||
file = {/home/alice/Zotero/storage/FUPJTWVD/Frey et al. - 2023 - Process-Commutative Distributed Objects From Cryp.pdf}
|
||
}
|
||
|
||
@article{freySynchronizationPowerConsensus2023,
|
||
title = {The {{Synchronization Power}} ({{Consensus Number}}) of {{Access-Control Objects}}: The {{Case}} of {{AllowList}} and {{DenyList}}},
|
||
author = {Frey, Davide and Gestin, Mathieu and Raynal, Michel},
|
||
year = 2023,
|
||
abstract = {This article studies the synchronization power of AllowList and DenyList objects under the lens provided by Herlihy's consensus hierarchy. It specifies AllowList and DenyList as distributed objects and shows that, while they can both be seen as specializations of a more general object type, they inherently have different synchronization power. While the AllowList object does not require synchronization between participating processes, a DenyList object requires processes to reach consensus on a specific set of processes. These results are then applied to a more global analysis of anonymity-preserving systems that use AllowList and DenyList objects. First, a blind-signaturebased e-voting is presented. Second, DenyList and AllowList objects are used to determine the consensus number of a specific decentralized key management system. Third, an anonymous money transfer algorithm using the association of AllowList and DenyList objects is presented. Finally, this analysis is used to study the properties of these application, and to highlight efficiency gains that they can achieve in message passing environment.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/6QUDH47S/Frey et al. - 2023 - The Synchronization Power (Consensus Number) of Ac.pdf}
|
||
}
|
||
|
||
@article{freySynchronizationPowerConsensus2023a,
|
||
title = {The {{Synchronization Power}} ({{Consensus Number}}) of {{Access-Control Objects}}: {{The Case}} of {{AllowList}} and {{DenyList}}},
|
||
shorttitle = {The {{Synchronization Power}} ({{Consensus Number}}) of {{Access-Control Objects}}},
|
||
author = {Frey, Davide and Gestin, Mathieu and Raynal, Michel},
|
||
year = 2023,
|
||
journal = {LIPIcs, Volume 281, DISC 2023},
|
||
volume = {281},
|
||
eprint = {2302.06344},
|
||
primaryclass = {cs},
|
||
pages = {21:1-21:23},
|
||
issn = {1868-8969},
|
||
doi = {10.4230/LIPIcs.DISC.2023.21},
|
||
urldate = {2024-11-26},
|
||
abstract = {This article studies the synchronization power of AllowList and DenyList objects under the lens provided by Herlihy's consensus hierarchy. It specifies AllowList and DenyList as distributed objects and shows that, while they can both be seen as specializations of a more general object type, they inherently have different synchronization power. While the AllowList object does not require synchronization between participating processes, a DenyList object requires processes to reach consensus on a specific set of processes. These results are then applied to a more global analysis of anonymity-preserving systems that use AllowList and DenyList objects. The specification .First, a blind-signature-based e-voting is presented. Second, DenyList and AllowList objects are used to determine the consensus number of a specific decentralized key management system. Third, an anonymous money transfer protocol using the association of AllowList and DenyList objects is presented. Finally, this study is used to study the properties of these application, and to highlight efficiency gains that they can achieve in message passing environment.},
|
||
archiveprefix = {arXiv},
|
||
langid = {english},
|
||
keywords = {Computer Science - Distributed Parallel and Cluster Computing},
|
||
file = {/home/alice/Zotero/storage/A34D39Z8/Frey et al. - 2023 - The Synchronization Power (Consensus Number) of Ac.pdf}
|
||
}
|
||
|
||
@article{freySynchronizationPowerConsensus2023b,
|
||
title = {The {{Synchronization Power}} ({{Consensus Number}}) of {{Access-Control Objects}}: {{The Case}} of {{AllowList}} and {{DenyList}}},
|
||
shorttitle = {The {{Synchronization Power}} ({{Consensus Number}}) of {{Access-Control Objects}}},
|
||
author = {Frey, Davide and Gestin, Mathieu and Raynal, Michel},
|
||
year = 2023,
|
||
journal = {LIPIcs, Volume 281, DISC 2023},
|
||
volume = {281},
|
||
eprint = {2302.06344},
|
||
primaryclass = {cs},
|
||
pages = {21:1-21:23},
|
||
issn = {1868-8969},
|
||
doi = {10.4230/LIPIcs.DISC.2023.21},
|
||
urldate = {2025-03-10},
|
||
abstract = {This article studies the synchronization power of AllowList and DenyList objects under the lens provided by Herlihy's consensus hierarchy. It specifies AllowList and DenyList as distributed objects and shows that while they can both be seen as specializations of a more general object type, they inherently have different synchronization properties. While the AllowList object does not require synchronization between participating processes, a DenyList object requires processes to reach consensus on a specific set of processes. These results are then applied to the analysis of anonymity-preserving systems that use AllowList and DenyList objects. First, a blind-signature-based e-voting is presented. Then DenyList and AllowList objects are used to determine the consensus number of a specific decentralized key management system. Finally, an anonymous money transfer protocol using the association of AllowList and DenyList objects is studied.},
|
||
archiveprefix = {arXiv},
|
||
keywords = {Computer Science - Distributed Parallel and Cluster Computing},
|
||
file = {/home/alice/Zotero/storage/RFEGVJIR/Frey et al. - 2023 - The Synchronization Power (Consensus Number) of Access-Control Objects The Case of AllowList and De.pdf;/home/alice/Zotero/storage/GEPICQNR/2302.html}
|
||
}
|
||
|
||
@article{ghasemshiraziZeroTrustApplications2023,
|
||
title = {Zero {{Trust}}: {{Applications}}, {{Challenges}}, and {{Opportunities}}},
|
||
author = {Ghasemshirazi, Saeid and Shirvani, Ghazaleh and Alipour, Mohammad Ali},
|
||
year = 2023,
|
||
month = dec,
|
||
abstract = {The escalating complexity of cybersecurity threats necessitates innovative approaches to safeguard digital assets and sensitive information. The Zero Trust paradigm offers a transformative solution by challenging conventional security models and emphasizing continuous verification and least privilege access. This survey comprehensively explores the theoretical foundations, practical implementations, applications, challenges, and future trends of Zero Trust. Through meticulous analysis, we highlight the relevance of Zero Trust in securing cloud environments, facilitating remote work, and protecting the Internet of Things (IoT) ecosystem. While cultural barriers and technical complexities present challenges, their mitigation unlocks Zero Trust's potential. Integrating Zero Trust with emerging technologies like AI and machine learning augments its efficacy, promising a dynamic and responsive security landscape. Embracing Zero Trust empowers organizations to navigate the ever-evolving cybersecurity realm with resilience and adaptability, redefining trust in the digital age.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/BRBHKZAQ/Ghasemshirazi et al. - Zero Trust Applications, Challenges, and Opportunities.pdf}
|
||
}
|
||
|
||
@inproceedings{giladAlgorandScalingByzantine2017,
|
||
title = {Algorand: {{Scaling Byzantine Agreements}} for {{Cryptocurrencies}}},
|
||
shorttitle = {Algorand},
|
||
booktitle = {Proceedings of the 26th {{Symposium}} on {{Operating Systems Principles}}},
|
||
author = {Gilad, Yossi and Hemo, Rotem and Micali, Silvio and Vlachos, Georgios and Zeldovich, Nickolai},
|
||
year = 2017,
|
||
month = oct,
|
||
pages = {51--68},
|
||
publisher = {ACM},
|
||
address = {Shanghai China},
|
||
doi = {10.1145/3132747.3132757},
|
||
urldate = {2024-01-26},
|
||
abstract = {Algorand is a new cryptocurrency that confirms transactions with latency on the order of a minute while scaling to many users. Algorand ensures that users never have divergent views of confirmed transactions, even if some of the users are malicious and the network is temporarily partitioned. In contrast, existing cryptocurrencies allow for temporary forks and therefore require a long time, on the order of an hour, to confirm transactions with high confidence.},
|
||
isbn = {978-1-4503-5085-3},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/TXF6ULXQ/Gilad et al. - 2017 - Algorand Scaling Byzantine Agreements for Cryptoc.pdf}
|
||
}
|
||
|
||
@inproceedings{goyalAttributebasedEncryptionFinegrained2006,
|
||
title = {Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data},
|
||
booktitle = {Proceedings of the 13th {{ACM}} Conference on {{Computer}} and Communications Security},
|
||
author = {Goyal, Vipul and Pandey, Omkant and Sahai, Amit and Waters, Brent},
|
||
year = 2006,
|
||
month = oct,
|
||
pages = {89--98},
|
||
publisher = {ACM},
|
||
address = {Alexandria Virginia USA},
|
||
doi = {10.1145/1180405.1180418},
|
||
urldate = {2023-12-08},
|
||
abstract = {As more sensitive data is shared and stored by third-party sites on the Internet, there will be a need to encrypt data stored at these sites. One drawback of encrypting data, is that it can be selectively shared only at a coarse-grained level (i.e., giving another party your private key). We develop a new cryptosystem for fine-grained sharing of encrypted data that we call Key-Policy Attribute-Based Encryption (KP-ABE). In our cryptosystem, ciphertexts are labeled with sets of attributes and private keys are associated with access structures that control which ciphertexts a user is able to decrypt. We demonstrate the applicability of our construction to sharing of audit-log information and broadcast encryption. Our construction supports delegation of private keys which subsumes Hierarchical Identity-Based Encryption (HIBE).},
|
||
isbn = {978-1-59593-518-2},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/Z9NEMU4F/Goyal et al. - 2006 - Attribute-based encryption for fine-grained access.pdf}
|
||
}
|
||
|
||
@inproceedings{huttoSlowMemoryWeakening1990,
|
||
title = {Slow Memory: Weakening Consistency to Enhance Concurrency in Distributed Shared Memories},
|
||
shorttitle = {Slow Memory},
|
||
booktitle = {Proceedings.,10th {{International Conference}} on {{Distributed Computing Systems}}},
|
||
author = {Hutto, P. W. and Ahamad, M.},
|
||
year = 1990,
|
||
month = jan,
|
||
pages = {302,303,304,305,306,307,308,309--302,303,304,305,306,307,308,309},
|
||
publisher = {IEEE Computer Society},
|
||
doi = {10.1109/ICDCS.1990.89297},
|
||
urldate = {2023-06-06},
|
||
abstract = {The use of weakly consistent memories in distributed shared memory systems to combat unacceptable network delay and to allow such systems to scale is proposed. Proposed memory correctness conditions are surveyed, and how they are related by a weakness hierarchy is demonstrated. Multiversion and messaging interpretations of memory are introduced as means of systematically exploring the space of possible memories. Slow memory is presented as a memory that allows the effects of writes to propagate slowly through the system, eliminating the need for costly consistency maintenance protocols that limit concurrency. Slow memory processes a valuable locality property and supports a reduction from traditional atomic memory. Thus slow memory is as expressive as atomic memory. This expressiveness is demonstrated by two exclusion algorithms and a solution to M.J. Fischer and A. Michael's (1982) dictionary problem on slow memory.},
|
||
langid = {english},
|
||
file = {/home/amaury/Téléchargements/Hutto et Ahamad - 1990 - Slow memory weakening consistency to enhance conc.pdf}
|
||
}
|
||
|
||
@inproceedings{huttoSlowMemoryWeakening1990a,
|
||
title = {Slow Memory: Weakening Consistency to Enhance Concurrency in Distributed Shared Memories},
|
||
shorttitle = {Slow Memory},
|
||
booktitle = {Proceedings.,10th {{International Conference}} on {{Distributed Computing Systems}}},
|
||
author = {Hutto, P. W. and Ahamad, M.},
|
||
year = 1990,
|
||
month = jan,
|
||
pages = {302,303,304,305,306,307,308,309--302,303,304,305,306,307,308,309},
|
||
publisher = {IEEE Computer Society},
|
||
doi = {10.1109/ICDCS.1990.89297},
|
||
urldate = {2023-06-06},
|
||
abstract = {The use of weakly consistent memories in distributed shared memory systems to combat unacceptable network delay and to allow such systems to scale is proposed. Proposed memory correctness conditions are surveyed, and how they are related by a weakness hierarchy is demonstrated. Multiversion and messaging interpretations of memory are introduced as means of systematically exploring the space of possible memories. Slow memory is presented as a memory that allows the effects of writes to propagate slowly through the system, eliminating the need for costly consistency maintenance protocols that limit concurrency. Slow memory processes a valuable locality property and supports a reduction from traditional atomic memory. Thus slow memory is as expressive as atomic memory. This expressiveness is demonstrated by two exclusion algorithms and a solution to M.J. Fischer and A. Michael's (1982) dictionary problem on slow memory.},
|
||
langid = {english}
|
||
}
|
||
|
||
@misc{IEEEXploreFullText,
|
||
title = {{{IEEE Xplore Full-Text PDF}}:},
|
||
urldate = {2024-01-12},
|
||
howpublished = {https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\&arnumber=9351908},
|
||
file = {/home/alice/Zotero/storage/NWIBEA72/stamp.html}
|
||
}
|
||
|
||
@article{jacobAnalysisMatrixEvent2021,
|
||
title = {Analysis of the {{Matrix Event Graph Replicated Data Type}}},
|
||
author = {Jacob, Florian and Beer, Carolin and Henze, Norbert and Hartenstein, Hannes},
|
||
year = 2021,
|
||
journal = {IEEE Access},
|
||
volume = {9},
|
||
pages = {28317--28333},
|
||
issn = {2169-3536},
|
||
doi = {10.1109/ACCESS.2021.3058576},
|
||
urldate = {2024-01-12},
|
||
abstract = {Matrix is a new kind of decentralized, topic-based publish-subscribe middleware for communication and data storage that is getting particularly popular as a basis for secure instant messaging. By comparison with traditional decentralized communication systems, Matrix replaces pure message passing with a replicated data structure. This data structure, which we extract and call the Matrix Event Graph (MEG), depicts the causal history of messages. We show that this MEG represents an interesting and important replicated data type for decentralized applications that are based on causal histories of publish-subscribe events: First, we prove that the MEG is a Conflict-Free Replicated Data Type for causal histories and, thus, provides Strong Eventual Consistency (SEC). With SEC being among the best known achievable trade-offs in the scope of the well-known CAP theorem, the MEG provides a powerful consistency guarantee while being available during network partition. Second, we discuss the implications of byzantine attackers on the data type's properties. We note that the MEG, as it does not strive for consensus or strong consistency, can cope with n {$>$} f environments with n participants, of which f are byzantine. Furthermore, we analyze scalability: Using Markov chains, we study the number of forward extremities of the MEG over time and observe an almost optimal evolution. We conjecture that this property is inherent to the underlying spatially inhomogeneous random walk. With the properties shown, a MEG represents a promising element in the set of data structures for decentralized applications, but with distinct trade-offs compared to traditional blockchains and distributed ledger technologies.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/TRSMADSW/Jacob et al. - 2021 - Analysis of the Matrix Event Graph Replicated Data.pdf}
|
||
}
|
||
|
||
@misc{jacobConflictFreeReplicatedData2021,
|
||
title = {On {{Conflict-Free Replicated Data Types}} and {{Equivocation}} in {{Byzantine Setups}}},
|
||
author = {Jacob, Florian and Bayreuther, Saskia and Hartenstein, Hannes},
|
||
year = 2021,
|
||
month = oct,
|
||
number = {arXiv:2109.10554},
|
||
eprint = {2109.10554},
|
||
primaryclass = {cs},
|
||
publisher = {arXiv},
|
||
urldate = {2024-01-22},
|
||
abstract = {We explore the property of equivocation tolerance for ConflictFree Replicated Data Types (CRDTs). We show that a subclass of CRDTs is equivocation-tolerant and can thereby cope with any number of Byzantine faults: Without equivocation detection, prevention or remediation, they still fulfill strong eventual consistency (SEC). We also conjecture that there is only one operation-based CRDT design supporting noncommutative operations that fulfills SEC in Byzantine environments with any number of faults.},
|
||
archiveprefix = {arXiv},
|
||
langid = {english},
|
||
keywords = {Computer Science - Data Structures and Algorithms,Computer Science - Distributed Parallel and Cluster Computing},
|
||
file = {/home/alice/Zotero/storage/VRL4ILBS/Jacob et al. - 2021 - On Conflict-Free Replicated Data Types and Equivoc.pdf}
|
||
}
|
||
|
||
@article{jacobCRDTsByzantineEnvironments,
|
||
title = {On {{CRDTs}} in {{Byzantine Environments}}},
|
||
author = {Jacob, Florian and Bayreuther, Saskia and Hartenstein, Hannes},
|
||
abstract = {Conflict-free Replicated Data Types (CRDTs) allow updates to be applied to different replicas independently and concurrently, without the need for a remote conflict resolution. Thus, they provide a building block for scalability and performance of fault-tolerant distributed systems. Currently, CRDTs are typically used in a crash fault setting for global scale, partition-tolerant, highly available databases or collaborative applications. In this paper, we explore the use of CRDTs in Byzantine environments. This exploration is inspired by the popular Matrix messaging system: as recently shown, the underlying Matrix Event Graph replicated data type represents a CRDT that can very well deal with Byzantine behavior. This ``Byzantine Tolerance'' is due to mechanisms inherent in CRDTs and in the hash-based directed acyclic graph (HashDAG) data structure used in Matrix. These mechanisms restrict Byzantine behavior. We, therefore, discuss Byzantine behavior in a context of CRDTs, and how the notion of Byzantine tolerance relates to equivocation. We show that a subclass of CRDTs is equivocation-tolerant, i.e., without equivocation detection, prevention or remediation, this subclass still fulfills the CRDT properties, which leads to Byzantine tolerance. We conjecture that an operation-based Byzantine-tolerant CRDT design supporting non-commutative operations needs to be based on a HashDAG data structure. We close the paper with thoughts on chances and limits of this data type.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/DHXTBI85/Jacob et al. - On CRDTs in Byzantine Environments.pdf}
|
||
}
|
||
|
||
@article{kangTheoryApplicationZero2023,
|
||
title = {Theory and {{Application}} of {{Zero Trust Security}}: {{A Brief Survey}}},
|
||
shorttitle = {Theory and {{Application}} of {{Zero Trust Security}}},
|
||
author = {Kang, Hongzhaoning and Liu, Gang and Wang, Quan and Meng, Lei and Liu, Jing},
|
||
year = 2023,
|
||
month = nov,
|
||
journal = {Entropy},
|
||
volume = {25},
|
||
number = {12},
|
||
pages = {1595},
|
||
issn = {1099-4300},
|
||
doi = {10.3390/e25121595},
|
||
urldate = {2025-03-17},
|
||
abstract = {As cross-border access becomes more frequent, traditional perimeter-based network security models can no longer cope with evolving security requirements. Zero trust is a novel paradigm for cybersecurity based on the core concept of ``never trust, always verify''. It attempts to protect against security risks related to internal threats by eliminating the demarcations between the internal and external network of traditional network perimeters. Nevertheless, research on the theory and application of zero trust is still in its infancy, and more extensive research is necessary to facilitate a deeper understanding of the paradigm in academia and the industry. In this paper, trust in cybersecurity is discussed, following which the origin, concepts, and principles related to zero trust are elaborated on. The characteristics, strengths, and weaknesses of the existing research are analysed in the context of zero trust achievements and their technical applications in Cloud and IoT environments. Finally, to support the development and application of zero trust in the future, the concept and its current challenges are analysed.},
|
||
copyright = {https://creativecommons.org/licenses/by/4.0/},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/TJXC6RZC/Kang et al. - 2023 - Theory and Application of Zero Trust Security A Brief Survey.pdf}
|
||
}
|
||
|
||
@article{kindervagNoMoreChewy2010,
|
||
title = {No {{More Chewy Centers}}: {{Introducing The Zero Trust Model Of Information Security}}},
|
||
author = {Kindervag, John},
|
||
year = 2010,
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/DWRGWN7N/Kindervag - 2010 - No More Chewy Centers Introducing The Zero Trust Model Of Information Security.pdf}
|
||
}
|
||
|
||
@article{kleppmannConflictFreeReplicatedJSON2017,
|
||
title = {A {{Conflict-Free Replicated JSON Datatype}}},
|
||
author = {Kleppmann, Martin and Beresford, Alastair R.},
|
||
year = 2017,
|
||
month = oct,
|
||
journal = {IEEE Transactions on Parallel and Distributed Systems},
|
||
volume = {28},
|
||
number = {10},
|
||
eprint = {1608.03960},
|
||
primaryclass = {cs},
|
||
pages = {2733--2746},
|
||
issn = {1045-9219},
|
||
doi = {10.1109/TPDS.2017.2697382},
|
||
urldate = {2023-12-10},
|
||
abstract = {Many applications model their data in a general-purpose storage format such as JSON. This data structure is modified by the application as a result of user input. Such modifications are well understood if performed sequentially on a single copy of the data, but if the data is replicated and modified concurrently on multiple devices, it is unclear what the semantics should be. In this paper we present an algorithm and formal semantics for a JSON data structure that automatically resolves concurrent modifications such that no updates are lost, and such that all replicas converge towards the same state (a conflict-free replicated datatype or CRDT). It supports arbitrarily nested list and map types, which can be modified by insertion, deletion and assignment. The algorithm performs all merging client-side and does not depend on ordering guarantees from the network, making it suitable for deployment on mobile devices with poor network connectivity, in peer-to-peer networks, and in messaging systems with end-to-end encryption.},
|
||
archiveprefix = {arXiv},
|
||
langid = {english},
|
||
keywords = {Computer Science - Databases,Computer Science - Distributed Parallel and Cluster Computing},
|
||
file = {/home/alice/Zotero/storage/BQVG57MU/Kleppmann et Beresford - 2017 - A Conflict-Free Replicated JSON Datatype.pdf}
|
||
}
|
||
|
||
@inproceedings{kleppmannMakingCRDTsByzantine2022,
|
||
title = {Making {{CRDTs Byzantine}} Fault Tolerant},
|
||
booktitle = {Proceedings of the 9th {{Workshop}} on {{Principles}} and {{Practice}} of {{Consistency}} for {{Distributed Data}}},
|
||
author = {Kleppmann, Martin},
|
||
year = 2022,
|
||
month = apr,
|
||
pages = {8--15},
|
||
publisher = {ACM},
|
||
address = {Rennes France},
|
||
doi = {10.1145/3517209.3524042},
|
||
urldate = {2024-01-12},
|
||
abstract = {It is often claimed that Conflict-free Replicated Data Types (CRDTs) ensure consistency of replicated data in peer-topeer systems. However, peer-to-peer systems usually consist of untrusted nodes that may deviate from the specified protocol (i.e. exhibit Byzantine faults), and most existing CRDT algorithms cannot guarantee consistency in the presence of such faults. This paper shows how to adapt existing non-Byzantine CRDT algorithms and make them Byzantine fault-tolerant. The proposed scheme can tolerate any number of Byzantine nodes (making it immune to Sybil attacks), guarantees Strong Eventual Consistency, and requires only modest changes to existing CRDT algorithms.},
|
||
isbn = {978-1-4503-9256-3},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/8K37LERF/Kleppmann - 2022 - Making CRDTs Byzantine fault tolerant.pdf}
|
||
}
|
||
|
||
@article{kumarApplicationDataCollected2023,
|
||
title = {Application of {{Data Collected}} by {{Endpoint Detection}} and {{Response Systems}} for {{Implementation}} of a {{Network Security System}} Based on {{Zero Trust Principles}} and the {{EigenTrust Algorithm}}},
|
||
author = {Kumar, Nitesh and Kasbekar, Gaurav S. and Manjunath, D.},
|
||
year = 2023,
|
||
month = apr,
|
||
journal = {ACM SIGMETRICS Performance Evaluation Review},
|
||
volume = {50},
|
||
number = {4},
|
||
pages = {5--7},
|
||
issn = {0163-5999},
|
||
doi = {10.1145/3595244.3595247},
|
||
urldate = {2025-03-17},
|
||
abstract = {Traditionally, security systems for enterprises have implicit access based on strong cryptography, authentication and key sharing, wherein access control is based on Role Based Access Control (RBAC), in which roles such as manager, accountant and so on provide a way of deciding a subject's authority. However, years of post-attack analysis on enterprise networks has shown that a majority of times, security breaches occur intentionally or accidently due to implicitly trusted people of an enterprise itself. Zero Trust Architecture works on the principle of never granting trust implicitly, but rather continuously evaluating the trust parameters for each resource access request and has a strict, but not rigid, set of protocols for access control of a subject to resources. Endpoint Detection and Response (EDR) systems are tools that collect a large number of attributes in and around machines within an enterprise network to have close visibility into sophisticated intrusion. In our work, we seek to deploy EDR systems and build trust algorithms using tactical provenance analysis, threshold cryptography and reputation management to continuously record data, evaluate trust of a subject, and simultaneously analyze them against a database of known threat vectors to provide conditional access control. However, EDR tools generate a high volume of data that leads to false alarms, misdetections and correspondingly a high backlog of tasks that makes it infeasible, which is addressed using tactical provenance analysis and information theory.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/6PJ5RIRN/Kumar et al. - 2023 - Application of Data Collected by Endpoint Detection and Response Systems for Implementation of a Net.pdf}
|
||
}
|
||
|
||
@phdthesis{kumarFaultTolerantDistributedServices2019,
|
||
title = {Fault-{{Tolerant Distributed Services}} in {{Message-Passing Systems}}},
|
||
author = {Kumar, Saptaparni},
|
||
year = 2019,
|
||
school = {Texas A\&M University},
|
||
file = {/home/alice/Zotero/storage/Q9XK77W9/Kumar - 2019 - Fault-Tolerant Distributed Services in Message-Pas.pdf;/home/alice/Zotero/storage/7JB26RAJ/1.html}
|
||
}
|
||
|
||
@article{lamportHowMakeMultiprocessor1979,
|
||
title = {How to {{Make}} a {{Multiprocessor Computer That Correctly Executes Multiprocess Programs}}},
|
||
author = {{Lamport}},
|
||
year = 1979,
|
||
month = sep,
|
||
journal = {IEEE Transactions on Computers},
|
||
volume = {C-28},
|
||
number = {9},
|
||
pages = {690--691},
|
||
issn = {1557-9956},
|
||
doi = {10.1109/TC.1979.1675439},
|
||
abstract = {Many large sequential computers execute operations in a different order than is specified by the program. A correct execution is achieved if the results produced are the same as would be produced by executing the program steps in order. For a multiprocessor computer, such a correct execution by each processor does not guarantee the correct execution of the entire program. Additional conditions are given which do guarantee that a computer correctly executes multiprocess programs.},
|
||
keywords = {Computer design,concurrent computing,hardware correctness,multiprocessing,parallel processing},
|
||
file = {/home/alice/Zotero/storage/GY8CWGUV/Lamport - 1979 - How to Make a Multiprocessor Computer That Correct.pdf;/home/alice/Zotero/storage/IVGSSPNE/1675439.html}
|
||
}
|
||
|
||
@article{lamportInterprocessCommunication1986,
|
||
title = {On Interprocess Communication},
|
||
author = {Lamport, Leslie},
|
||
year = 1986,
|
||
month = jun,
|
||
journal = {Distributed Computing},
|
||
volume = {1},
|
||
number = {2},
|
||
pages = {86--101},
|
||
issn = {1432-0452},
|
||
doi = {10.1007/BF01786228},
|
||
urldate = {2023-06-08},
|
||
abstract = {Interprocess communication is studied without assuming any lower-level communication primitives. Three classes of communication registers are considered, and several constructions are given for implementing one class of register with a weaker class. The formalism developed in Part I is used in proving the correctness of these constructions.},
|
||
langid = {english},
|
||
keywords = {Communication Network,Computer Hardware,Computer System,Operating System,System Organization},
|
||
file = {/home/alice/Zotero/storage/XV7AEARN/Lamport - 1986 - On interprocess communication.pdf}
|
||
}
|
||
|
||
@article{liAdmissibilityBasedOperationalTransformation2010,
|
||
title = {An {{Admissibility-Based Operational Transformation Framework}} for {{Collaborative Editing Systems}}},
|
||
author = {Li, Du and Li, Rui},
|
||
year = 2010,
|
||
month = feb,
|
||
journal = {Computer Supported Cooperative Work (CSCW)},
|
||
volume = {19},
|
||
number = {1},
|
||
pages = {1--43},
|
||
issn = {1573-7551},
|
||
doi = {10.1007/s10606-009-9103-1},
|
||
urldate = {2024-06-24},
|
||
abstract = {Operational transformation (OT) as a consistency control method has been well accepted in group editors. With OT, the users can edit any part of a shared document at any time and local responsiveness is not sensitive to communication latencies. However, established theoretical frameworks for developing OT algorithms either require transformation functions to work in all possible cases, which complicates the design of transformation functions, or include an under-formalized condition of intention preservation, which results in algorithms that cannot be formally proved and must be fixed over time to address newly discovered counterexamples. To address those limitations, this paper proposes an alternative framework, called admissibility-based transformation (ABT), that is theoretically based on formalized, provable correctness criteria and practically no longer requires transformation functions to work under all conditions. Compared to previous approaches, ABT simplifies the design and proofs of OT algorithms.},
|
||
langid = {english},
|
||
keywords = {collaboration,consistency control,CSCW,group editor,operational transformation},
|
||
file = {/home/alice/Zotero/storage/KT3NDCSQ/Li et Li - 2010 - An Admissibility-Based Operational Transformation .pdf}
|
||
}
|
||
|
||
@book{liptonPRAMScalableShared1988,
|
||
title = {{{PRAM}}: {{A Scalable Shared Memory}}},
|
||
shorttitle = {{{PRAM}}},
|
||
author = {Lipton, Richard J. and Sandberg, Jonathan S.},
|
||
year = 1988,
|
||
publisher = {Princeton University, Department of Computer Science},
|
||
googlebooks = {962epwAACAAJ},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/3ZYT3WT4/Lipton et Sandberg - 1988 - PRAM A Scalable Shared Memory.pdf}
|
||
}
|
||
|
||
@article{liuZeroTrustBasedMobile2024,
|
||
title = {Zero {{Trust-Based Mobile Network Security Architecture}}},
|
||
author = {Liu, Yiliang and Su, Zhou and Peng, Haixia and Xiang, Yushan and Wang, Wei and Li, Ruidong},
|
||
year = 2024,
|
||
month = apr,
|
||
journal = {IEEE Wireless Communications},
|
||
volume = {31},
|
||
number = {2},
|
||
pages = {82--88},
|
||
issn = {1558-0687},
|
||
doi = {10.1109/MWC.001.2300375},
|
||
urldate = {2025-03-31},
|
||
abstract = {With the rapid advancement of air interface technology and the exponential growth of mobile services, mobile networks have become significantly complex. Traditional network security models, relying on regional defense strategies, are no longer sufficient to meet the current security demands. This article proposes the zero-trust architecture as a potential security mode for 6G. However, the distributed network architecture, the proliferation of connected devices, and the diverse service requirements of 6G pose sub-stantial challenges to this security model implementation. To address these issues, the article explores the opportunities presented by artificial intelligence (Al) and novel air interface technologies, which promote robust and efficient identity authentication, access control, and confidential data transmission for 6G. Finally, the article outlines a visionary outlook for the zero trust-based 6G security architecture, highlighting its potential impact on the future of mobile networks.},
|
||
keywords = {6G mobile communication,Access control,Atmospheric modeling,Authentication,Communication channels,Network security,Semantics},
|
||
file = {/home/alice/Zotero/storage/63ITAZR4/10495913.html}
|
||
}
|
||
|
||
@article{misraAxiomsMemoryAccess1986,
|
||
title = {Axioms for Memory Access in Asynchronous Hardware Systems},
|
||
author = {Misra, J.},
|
||
year = 1986,
|
||
month = jan,
|
||
journal = {ACM Transactions on Programming Languages and Systems},
|
||
volume = {8},
|
||
number = {1},
|
||
pages = {142--153},
|
||
issn = {0164-0925, 1558-4593},
|
||
doi = {10.1145/5001.5007},
|
||
urldate = {2023-06-08},
|
||
abstract = {The problem of concurrent accesses to registers by asynchronous components is considered. A set of axioms about the values in a register during concurrent accesses is proposed. It is shown that if these axioms are met by a register, then concurrent accesses to it may be viewed as nonconcurrent, thus making it possible to analyze asynchronous algorithms without elaborate timing analysis of operations. These axioms are shown, in a certain sense, to be the weakest. Motivation for this work came from analyzing low-level hardware components in a VLSI chip which concurrently accesses a flip-flop.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/KZP2774N/Misra - 1986 - Axioms for memory access in asynchronous hardware .pdf}
|
||
}
|
||
|
||
@misc{misraByzantineFaultTolerant2021,
|
||
title = {Byzantine {{Fault Tolerant Causal Ordering}}},
|
||
author = {Misra, Anshuman and Kshemkalyani, Ajay},
|
||
year = 2021,
|
||
month = dec,
|
||
number = {arXiv:2112.11337},
|
||
eprint = {2112.11337},
|
||
primaryclass = {cs},
|
||
publisher = {arXiv},
|
||
urldate = {2023-07-12},
|
||
abstract = {Causal ordering in an asynchronous system has many applications in distributed computing, including in replicated databases and real-time collaborative software. Previous work in the area focused on ordering point-to-point messages in a fault-free setting, and on ordering broadcasts under various fault models. To the best of our knowledge, Byzantine faulttolerant causal ordering has not been attempted for point-topoint communication in an asynchronous setting. In this paper, we first show that existing algorithms for causal ordering of point-to-point communication fail under Byzantine faults. We then prove that it is impossible to causally order messages under point-to-point communication in an asynchronous system with one or more Byzantine failures. We then present two algorithms that can causally order messages under Byzantine failures, where the network provides an upper bound on the message transmission time. The proofs of correctness for these algorithms show that it is possible to achieve causal ordering for point-to-point communication under a stronger asynchrony model where the network provides an upper bound on message transmission time. We also give extensions of our two algorithms for Byzantine fault-tolerant causal ordering of multicasts.},
|
||
archiveprefix = {arXiv},
|
||
langid = {english},
|
||
keywords = {Computer Science - Distributed Parallel and Cluster Computing},
|
||
file = {/home/alice/Zotero/storage/P2R366US/Misra and Kshemkalyani - 2021 - Byzantine Fault Tolerant Causal Ordering.pdf}
|
||
}
|
||
|
||
@article{mosbergerMemoryConsistencyModels1993,
|
||
title = {Memory Consistency Models},
|
||
author = {Mosberger, David},
|
||
year = 1993,
|
||
month = jan,
|
||
journal = {ACM SIGOPS Operating Systems Review},
|
||
volume = {27},
|
||
number = {1},
|
||
pages = {18--26},
|
||
issn = {0163-5980},
|
||
doi = {10.1145/160551.160553},
|
||
urldate = {2023-06-06},
|
||
abstract = {This paper discusses memory consistency models and their influence on software in the context of parallel machines. In the first part we review previous work on memory consistency models. The second part discusses the issues that arise due to weakening memory consistency. We are especially interested in the influence that weakened consistency models have on language, compiler, and runtime system design. We conclude that tighter interaction between those parts and the memory system might improve performance considerably.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/VF2ZNK6A/Mosberger - 1993 - Memory consistency models.pdf}
|
||
}
|
||
|
||
@book{MPBook,
|
||
title = {{Concurrence et coh\'erence dans les syst\`emes r\'epartis}},
|
||
author = {Perrin, Matthieu},
|
||
year = 2017,
|
||
month = sep,
|
||
publisher = {ISTE Group},
|
||
abstract = {La soci\'et\'e moderne est de plus en plus domin\'ee par la soci\'et\'e virtuelle, le nombre d'internautes dans le monde ayant d\'epass\'e les trois milliards en 2015. A la diff\'erence de leurs homologues s\'equentiels, les syst\`emes r\'epartis sont beaucoup plus difficiles \`a concevoir, et sont donc sujets \`a de nombreux probl\`emes.La coh\'erence s\'equentielle fournit la m\^eme vue globale \`a tous les utilisateurs, mais le confort d\&\#39;utilisation qu\&\#39;elle apporte est trop co\^uteux, voire impossible, \`a mettre en oeuvre \`a grande \'echelle.~Concurrence et coh\'erence dans les syst\`emes r\'epartis~examine les meilleures fa\c cons de sp\'ecifier les objets que l'on peut tout de m\^eme impl\'ementer dans ces syst\`emes.Cet ouvrage explore la zone grise des syst\`emes r\'epartis et dresse une carte des crit\`eres de coh\'erence faible, identifiant plusieurs familles et d\'emontrant comment elles peuvent s'int\'egrer dans un langage de programmation.},
|
||
googlebooks = {6DRlDwAAQBAJ},
|
||
isbn = {978-1-78405-295-9},
|
||
langid = {french},
|
||
file = {/home/amaury/Téléchargements/Perrin - 2017 - Concurrence et cohérence dans les systèmes réparti.pdf}
|
||
}
|
||
|
||
@book{MPBook,
|
||
title = {{Concurrence et coh\'erence dans les syst\`emes r\'epartis}},
|
||
author = {Perrin, Matthieu},
|
||
year = 2017,
|
||
month = sep,
|
||
publisher = {ISTE Group},
|
||
abstract = {La soci\'et\'e moderne est de plus en plus domin\'ee par la soci\'et\'e virtuelle, le nombre d'internautes dans le monde ayant d\'epass\'e les trois milliards en 2015. A la diff\'erence de leurs homologues s\'equentiels, les syst\`emes r\'epartis sont beaucoup plus difficiles \`a concevoir, et sont donc sujets \`a de nombreux probl\`emes.La coh\'erence s\'equentielle fournit la m\^eme vue globale \`a tous les utilisateurs, mais le confort d\&\#39;utilisation qu\&\#39;elle apporte est trop co\^uteux, voire impossible, \`a mettre en oeuvre \`a grande \'echelle.~Concurrence et coh\'erence dans les syst\`emes r\'epartis~examine les meilleures fa\c cons de sp\'ecifier les objets que l'on peut tout de m\^eme impl\'ementer dans ces syst\`emes.Cet ouvrage explore la zone grise des syst\`emes r\'epartis et dresse une carte des crit\`eres de coh\'erence faible, identifiant plusieurs familles et d\'emontrant comment elles peuvent s'int\'egrer dans un langage de programmation.},
|
||
googlebooks = {6DRlDwAAQBAJ},
|
||
isbn = {978-1-78405-295-9},
|
||
langid = {french}
|
||
}
|
||
|
||
@incollection{mullerDistributedAttributeBasedEncryption2009,
|
||
title = {Distributed {{Attribute-Based Encryption}}},
|
||
booktitle = {Information {{Security}} and {{Cryptology}} -- {{ICISC}} 2008},
|
||
author = {M{\"u}ller, Sascha and Katzenbeisser, Stefan and Eckert, Claudia},
|
||
editor = {Lee, Pil Joong and Cheon, Jung Hee},
|
||
year = 2009,
|
||
volume = {5461},
|
||
pages = {20--36},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
address = {Berlin, Heidelberg},
|
||
doi = {10.1007/978-3-642-00730-9_2},
|
||
urldate = {2023-12-08},
|
||
abstract = {Ciphertext-Policy Attribute-Based Encryption (CP-ABE) allows to encrypt data under an access policy, specified as a logical combination of attributes. Such ciphertexts can be decrypted by anyone with a set of attributes that fits the policy. In this paper, we introduce the concept of Distributed Attribute-Based Encryption (DABE), where an arbitrary number of parties can be present to maintain attributes and their corresponding secret keys. This is in stark contrast to the classic CP-ABE schemes, where all secret keys are distributed by one central trusted party. We provide the first construction of a DABE scheme; the construction is very efficient, as it requires only a constant number of pairing operations during encryption and decryption.},
|
||
isbn = {978-3-642-00729-3 978-3-642-00730-9},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/CWKWPE9S/Müller et al. - 2009 - Distributed Attribute-Based Encryption.pdf}
|
||
}
|
||
|
||
@inproceedings{nicolaescuRealTimePeertoPeerShared2016,
|
||
title = {Near {{Real-Time Peer-to-Peer Shared Editing}} on {{Extensible Data Types}}},
|
||
booktitle = {Proceedings of the 19th {{International Conference}} on {{Supporting Group Work}}},
|
||
author = {Nicolaescu, Petru and Jahns, Kevin and Derntl, Michael and Klamma, Ralf},
|
||
year = 2016,
|
||
month = nov,
|
||
pages = {39--49},
|
||
publisher = {ACM},
|
||
address = {Sanibel Island Florida USA},
|
||
doi = {10.1145/2957276.2957310},
|
||
urldate = {2023-12-01},
|
||
isbn = {978-1-4503-4276-6},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/SV3MSLKD/Nicolaescu et al. - 2016 - Near Real-Time Peer-to-Peer Shared Editing on Exte.pdf}
|
||
}
|
||
|
||
@misc{NSONSDD,
|
||
title = {{{NSO NSDD}}},
|
||
urldate = {2023-12-08},
|
||
howpublished = {https://nso.nato.int/nso/nsdd/main/standards/ap-details/1967/EN},
|
||
file = {/home/alice/Zotero/storage/GWGECM7K/EN.html}
|
||
}
|
||
|
||
@inproceedings{preguicaCommutativeReplicatedData2009,
|
||
title = {A {{Commutative Replicated Data Type}} for {{Cooperative Editing}}},
|
||
booktitle = {2009 29th {{IEEE International Conference}} on {{Distributed Computing Systems}}},
|
||
author = {Preguica, Nuno and Marques, Joan Manuel and Shapiro, Marc and Letia, Mihai},
|
||
year = 2009,
|
||
month = jun,
|
||
pages = {395--403},
|
||
publisher = {IEEE},
|
||
address = {Montreal, Quebec, Canada},
|
||
doi = {10.1109/ICDCS.2009.20},
|
||
urldate = {2024-02-16},
|
||
abstract = {A Commutative Replicated Data Type (CRDT) is one where all concurrent operations commute. The replicas of a CRDT converge automatically, without complex concurrency control. This paper describes Treedoc, a novel CRDT design for cooperative text editing. An essential property is that the identifiers of Treedoc atoms are selected from a dense space. We discuss practical alternatives for implementing the identifier space based on an extended binary tree. We also discuss storage alternatives for data and meta-data, and mechanisms for compacting the tree. In the best case, Treedoc incurs no overhead with respect to a linear text buffer. We validate the results with traces from existing edit histories.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/LKX6LUIS/Preguica et al. - 2009 - A Commutative Replicated Data Type for Cooperative.pdf}
|
||
}
|
||
|
||
@misc{ramezanpourIntelligentZeroTrust2022,
|
||
title = {Intelligent {{Zero Trust Architecture}} for {{5G}}/{{6G Networks}}: {{Principles}}, {{Challenges}}, and the {{Role}} of {{Machine Learning}} in the Context of {{O-RAN}}},
|
||
shorttitle = {Intelligent {{Zero Trust Architecture}} for {{5G}}/{{6G Networks}}},
|
||
author = {Ramezanpour, Keyvan and Jagannath, Jithin},
|
||
year = 2022,
|
||
month = jul,
|
||
number = {arXiv:2105.01478},
|
||
eprint = {2105.01478},
|
||
primaryclass = {cs},
|
||
publisher = {arXiv},
|
||
doi = {10.48550/arXiv.2105.01478},
|
||
urldate = {2025-03-31},
|
||
abstract = {In this position paper, we discuss the critical need for integrating zero trust (ZT) principles into next-generation communication networks (5G/6G). We highlight the challenges and introduce the concept of an intelligent zero trust architecture (i-ZTA) as a security framework in 5G/6G networks with untrusted components. While network virtualization, software-defined networking (SDN), and service-based architectures (SBA) are key enablers of 5G networks, operating in an untrusted environment has also become a key feature of the networks. Further, seamless connectivity to a high volume of devices has broadened the attack surface on information infrastructure. Network assurance in a dynamic untrusted environment calls for revolutionary architectures beyond existing static security frameworks. To the best of our knowledge, this is the first position paper that presents the architectural concept design of an i-ZTA upon which modern artificial intelligence (AI) algorithms can be developed to provide information security in untrusted networks. We introduce key ZT principles as real-time Monitoring of the security state of network assets, Evaluating the risk of individual access requests, and Deciding on access authorization using a dynamic trust algorithm, called MED components. To ensure ease of integration, the envisioned architecture adopts an SBA-based design, similar to the 3GPP specification of 5G networks, by leveraging the open radio access network (O-RAN) architecture with appropriate real-time engines and network interfaces for collecting necessary machine learning data. Therefore, this work provides novel research directions to design machine learning based components that contribute towards i-ZTA for the future 5G/6G networks.},
|
||
archiveprefix = {arXiv},
|
||
langid = {english},
|
||
keywords = {Computer Science - Machine Learning,Computer Science - Networking and Internet Architecture},
|
||
file = {/home/alice/Zotero/storage/MSU7927L/Ramezanpour et Jagannath - 2022 - Intelligent Zero Trust Architecture for 5G6G Networks Principles, Challenges, and the Role of Mach.pdf}
|
||
}
|
||
|
||
@book{Raynal18,
|
||
title = {Fault-{{Tolerant Message-Passing Distributed Systems}}: {{An Algorithmic Approach}}},
|
||
shorttitle = {Fault-{{Tolerant Message-Passing Distributed Systems}}},
|
||
author = {Raynal, Michel},
|
||
year = 2018,
|
||
month = sep,
|
||
publisher = {Springer},
|
||
abstract = {This book presents the most important fault-tolerant distributed programming abstractions and their associated distributed algorithms, in particular in terms of reliable communication and agreement, which lie at the heart of nearly all distributed applications. These programming abstractions, distributed objects or services, allow software designers and programmers to cope with asynchrony and the most important types of failures such as process crashes, message losses, and malicious behaviors of computing entities, widely known under the term "Byzantine fault-tolerance". The author introduces these notions in an incremental manner, starting from a clear specification, followed by algorithms which are first described intuitively and then proved correct. The book also presents impossibility results in classic distributed computing models, along with strategies, mainly failure detectors and randomization, that allow us to enrich these models. In this sense, the book constitutes an introduction to the science of distributed computing, with applications in all domains of distributed systems, such as cloud computing and blockchains. Each chapter comes with exercises and bibliographic notes to help the reader approach, understand, and master the fascinating field of fault-tolerant distributed computing.},
|
||
googlebooks = {J6BtDwAAQBAJ},
|
||
isbn = {978-3-319-94141-7},
|
||
langid = {english},
|
||
keywords = {Computers / Computer Science,Computers / Information Technology,Computers / Networking / General,Technology & Engineering / Telecommunications}
|
||
}
|
||
|
||
@incollection{raynalCausalConsistencySequential1995,
|
||
title = {From Causal Consistency to Sequential Consistency in Shared Memory Systems},
|
||
booktitle = {Foundations of {{Software Technology}} and {{Theoretical Computer Science}}},
|
||
author = {Raynal, Michel and Schiper, Andr{\'e}},
|
||
editor = {Goos, Gerhard and Hartmanis, Juris and Leeuwen, Jan and Thiagarajan, P. S.},
|
||
year = 1995,
|
||
volume = {1026},
|
||
pages = {180--194},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
address = {Berlin, Heidelberg},
|
||
doi = {10.1007/3-540-60692-0_48},
|
||
urldate = {2023-06-06},
|
||
isbn = {978-3-540-60692-5 978-3-540-49263-4},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/B8UNWUSA/Raynal et Schiper - 1995 - From causal consistency to sequential consistency .pdf}
|
||
}
|
||
|
||
@misc{rodigariPerformanceAnalysisZeroTrust2021,
|
||
title = {Performance {{Analysis}} of {{Zero-Trust}} Multi-Cloud},
|
||
author = {Rodigari, Simone and O'Shea, Donna and McCarthy, Pat and McCarry, Martin and McSweeney, Sean},
|
||
year = 2021,
|
||
month = may,
|
||
number = {arXiv:2105.02334},
|
||
eprint = {2105.02334},
|
||
primaryclass = {cs},
|
||
publisher = {arXiv},
|
||
doi = {10.48550/arXiv.2105.02334},
|
||
urldate = {2025-03-31},
|
||
abstract = {Zero Trust security model permits to secure cloud native applications while encrypting all network communication, authenticating, and authorizing every request. The service mesh can enable Zero Trust using a side-car proxy without changes to the application code. To the best of our knowledge, no previous work has provided a performance analysis of Zero Trust in a multi-cloud environment. This paper proposes a multi-cloud framework and a testing workflow to analyse performance of the data plane under load and the impact on the control plane, when Zero Trust is enabled. The results of preliminary tests show that Istio has reduced latency variability in responding to sequential HTTP requests. Results also reveal that the overall CPU and memory usage can increase based on service mesh configuration and the cloud environment.},
|
||
archiveprefix = {arXiv},
|
||
langid = {english},
|
||
keywords = {Computer Science - Cryptography and Security},
|
||
file = {/home/alice/Zotero/storage/WFRRGNSM/Rodigari et al. - 2021 - Performance Analysis of Zero-Trust multi-cloud.pdf}
|
||
}
|
||
|
||
@techreport{roseZeroTrustArchitecture2020,
|
||
title = {Zero {{Trust Architecture}}},
|
||
author = {Rose, Scott and Borchert, Oliver and Mitchell, Stu and Connelly, Sean},
|
||
year = 2020,
|
||
month = aug,
|
||
institution = {{National Institute of Standards and Technology}},
|
||
doi = {10.6028/NIST.SP.800-207},
|
||
urldate = {2023-12-08},
|
||
abstract = {Zero trust (ZT) is the term for an evolving set of cybersecurity paradigms that move defenses from static, network-based perimeters to focus on users, assets, and resources. A zero trust architecture (ZTA) uses zero trust principles to plan industrial and enterprise infrastructure and workflows. Zero trust assumes there is no implicit trust granted to assets or user accounts based solely on their physical or network location (i.e., local area networks versus the internet) or based on asset ownership (enterprise or personally owned). Authentication and authorization (both subject and device) are discrete functions performed before a session to an enterprise resource is established. Zero trust is a response to enterprise network trends that include remote users, bring your own device (BYOD), and cloud-based assets that are not located within an enterpriseowned network boundary. Zero trust focuses on protecting resources (assets, services, workflows, network accounts, etc.), not network segments, as the network location is no longer seen as the prime component to the security posture of the resource. This document contains an abstract definition of zero trust architecture (ZTA) and gives general deployment models and use cases where zero trust could improve an enterprise's overall information technology security posture.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/6PRUAJZ3/Rose et al. - 2020 - Zero Trust Architecture.pdf}
|
||
}
|
||
|
||
@misc{roseZeroTrustArchitecture2020a,
|
||
title = {Zero {{Trust Architecture}}},
|
||
author = {Rose, Scott and Borchert, Oliver and Mitchell, Stu and Connelly, Sean},
|
||
year = 2020,
|
||
month = feb,
|
||
doi = {10.6028/NIST.SP.800-207-draft2},
|
||
urldate = {2025-03-17},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/UE68PSYK/Rose et al. - 2020 - Zero Trust Architecture.pdf}
|
||
}
|
||
|
||
@article{saitoOptimisticReplication2005,
|
||
title = {Optimistic {{Replication}}},
|
||
author = {Saito, Yasushi and Shapiro, Marc},
|
||
year = 2005,
|
||
journal = {ACM Computing Surveys},
|
||
volume = {37},
|
||
number = {1},
|
||
pages = {42},
|
||
doi = {10.1145/1057977.1057980},
|
||
urldate = {2023-06-09},
|
||
abstract = {Data replication is a key technology in distributed systems that enables higher availability and performance. This article surveys optimistic replication algorithms. They allow replica contents to diverge in the short term to support concurrent work practices and tolerate failures in low-quality communication links. The importance of such techniques is increasing as collaboration through wide-area and mobile networks becomes popular.Optimistic replication deploys algorithms not seen in traditional ``pessimistic'' systems. Instead of synchronous replica coordination, an optimistic algorithm propagates changes in the background, discovers conflicts after they happen, and reaches agreement on the final contents incrementally.We explore the solution space for optimistic replication algorithms. This article identifies key challenges facing optimistic replication systems---ordering operations, detecting and resolving conflicts, propagating changes efficiently, and bounding replica divergence---and provides a comprehensive survey of techniques developed for addressing these challenges.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/4WJX5IAN/Saito et Shapiro - 2005 - Optimistic Replication.pdf}
|
||
}
|
||
|
||
@inproceedings{shakaramiRefreshInsteadRevoke2019,
|
||
title = {Refresh {{Instead}} of {{Revoke Enhances Safety}} and {{Availability}}: {{A Formal Analysis}}},
|
||
shorttitle = {Refresh {{Instead}} of {{Revoke Enhances Safety}} and {{Availability}}},
|
||
booktitle = {33th {{IFIP Annual Conference}} on {{Data}} and {{Applications Security}} and {{Privacy}} ({{DBSec}})},
|
||
author = {Shakarami, Mehrnoosh and Sandhu, Ravi},
|
||
year = 2019,
|
||
month = jul,
|
||
volume = {LNCS-11559},
|
||
pages = {301},
|
||
publisher = {Springer International Publishing},
|
||
doi = {10.1007/978-3-030-22479-0_16},
|
||
urldate = {2023-06-09},
|
||
abstract = {Due to inherent delays and performance costs, the decision point in a distributed multi-authority Attribute-Based Access Control (ABAC) system is exposed to the risk of relying on outdated attribute values and policy; which is the safety and consistency problem. This paper formally characterizes three increasingly strong levels of consistency to restrict this exposure. Notably, we recognize the concept of refreshing attribute values rather than simply checking the revocation status, as in traditional approaches. Refresh replaces an older value with a newer one, while revoke simply invalidates the old value. Our lowest consistency level starts from the highest level in prior revocation-based work by Lee and Winslett (LW). Our two higher levels utilize the concept of request time which is absent in LW. For each of our levels we formally show that using refresh instead of revocation provides added safety and availability.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/XQNWKF7H/Shakarami et Sandhu - 2019 - Refresh Instead of Revoke Enhances Safety and Avai.pdf}
|
||
}
|
||
|
||
@incollection{shapiroConflictFreeReplicatedData2011,
|
||
title = {Conflict-{{Free Replicated Data Types}}},
|
||
booktitle = {Stabilization, {{Safety}}, and {{Security}} of {{Distributed Systems}}},
|
||
author = {Shapiro, Marc and Pregui{\c c}a, Nuno and Baquero, Carlos and Zawirski, Marek},
|
||
editor = {D{\'e}fago, Xavier and Petit, Franck and Villain, Vincent},
|
||
year = 2011,
|
||
volume = {6976},
|
||
pages = {386--400},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
address = {Berlin, Heidelberg},
|
||
doi = {10.1007/978-3-642-24550-3_29},
|
||
urldate = {2023-12-08},
|
||
abstract = {Replicating data under Eventual Consistency (EC) allows any replica to accept updates without remote synchronisation. This ensures performance and scalability in large-scale distributed systems (e.g., clouds). However, published EC approaches are ad-hoc and error-prone. Under a formal Strong Eventual Consistency (SEC) model, we study sufficient conditions for convergence. A data type that satisfies these conditions is called a Conflict-free Replicated Data Type (CRDT). Replicas of any CRDT are guaranteed to converge in a self-stabilising manner, despite any number of failures. This paper formalises two popular approaches (state- and operation-based) and their relevant sufficient conditions. We study a number of useful CRDTs, such as sets with clean semantics, supporting both add and remove operations, and consider in depth the more complex Graph data type. CRDT types can be composed to develop large-scale distributed applications, and have interesting theoretical properties.},
|
||
isbn = {978-3-642-24549-7 978-3-642-24550-3},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/QK99TF5K/Shapiro et al. - 2011 - Conflict-Free Replicated Data Types.pdf}
|
||
}
|
||
|
||
@article{shresthaTimeBoundContinuousAuthentication2021,
|
||
title = {A {{Time-Bound Continuous Authentication Protocol}} for {{Mesh Networking}}},
|
||
author = {Shrestha, Selina and Lopez, Martin Andreoni and Baddeley, Michael and Muhaidat, Sami and Giacalone, Jean-Pierre},
|
||
year = 2021,
|
||
month = dec,
|
||
journal = {2021 4th International Conference on Advanced Communication Technologies and Networking (CommNet)},
|
||
pages = {1--6},
|
||
publisher = {IEEE},
|
||
address = {Rabat, Morocco},
|
||
doi = {10.1109/CommNet52204.2021.9641895},
|
||
urldate = {2025-03-31},
|
||
abstract = {This paper proposes a novel lightweight authentication protocol for fast and efficient continuous authentication of constrained Internet of Things (IoT) mesh network devices. An initial static authentication takes place at the beginning of a session, during which the secret is securely shared between two parties. Once the session is established, the continuous authentication scheme generates time-bound tokens using the shared secret, a time-varying component, and a random value. These are used to verify the identity of the connected device in fixed time intervals. These time-bound tokens, which only remain valid for a predetermined time frame and ensure the continuity aspect of the mechanism, can be linked back to the original secret at the server for verification. Therefore, lightweight continuous authentication is achieved using only a few low complexity cryptographic operations, like hash and MAC, without the need to perform costly cryptographic operations. In case of failure, the node is temporarily blocked for an exponential function period of past occurrences of failure. Performance evaluation over a mesh routing protocol shows that our proposal fulfills lightweight and low bandwidth constraining requirements while satisfying the security requirements of an authentication scheme.},
|
||
copyright = {https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html},
|
||
isbn = {9781665403061}
|
||
}
|
||
|
||
@inproceedings{shresthaTimeBoundContinuousAuthentication2021a,
|
||
title = {A {{Time-Bound Continuous Authentication Protocol}} for {{Mesh Networking}}},
|
||
booktitle = {2021 4th {{International Conference}} on {{Advanced Communication Technologies}} and {{Networking}} ({{CommNet}})},
|
||
author = {Shrestha, Selina and Lopez, Martin Andreoni and Baddeley, Michael and Muhaidat, Sami and Giacalone, Jean-Pierre},
|
||
year = 2021,
|
||
month = dec,
|
||
pages = {1--6},
|
||
publisher = {IEEE},
|
||
address = {Rabat, Morocco},
|
||
doi = {10.1109/CommNet52204.2021.9641895},
|
||
urldate = {2025-03-31},
|
||
abstract = {This paper proposes a novel lightweight authentication protocol for fast and efficient continuous authentication of constrained Internet of Things (IoT) mesh network devices. An initial static authentication takes place at the beginning of a session, during which the secret is securely shared between two parties. Once the session is established, the continuous authentication scheme generates time-bound tokens using the shared secret, a time-varying component, and a random value. These are used to verify the identity of the connected device in fixed time intervals. These time-bound tokens, which only remain valid for a predetermined time frame and ensure the continuity aspect of the mechanism, can be linked back to the original secret at the server for verification. Therefore, lightweight continuous authentication is achieved using only a few low complexity cryptographic operations, like hash and MAC, without the need to perform costly cryptographic operations. In case of failure, the node is temporarily blocked for an exponential function period of past occurrences of failure. Performance evaluation over a mesh routing protocol shows that our proposal fulfills lightweight and low bandwidth constraining requirements while satisfying the security requirements of an authentication scheme.},
|
||
copyright = {https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html},
|
||
isbn = {978-1-6654-0306-1},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/JPQTLRLB/Shrestha et al. - 2021 - A Time-Bound Continuous Authentication Protocol for Mesh Networking.pdf}
|
||
}
|
||
|
||
@article{singhZenoEventuallyConsistent2009,
|
||
title = {Zeno: {{Eventually Consistent Byzantine-Fault Tolerance}}},
|
||
author = {Singh, Atul and Fonseca, Pedro and Kuznetsov, Petr and Rodrigues, Rodrigo and Maniatis, Petros},
|
||
year = 2009,
|
||
abstract = {Many distributed services are hosted at large, shared, geographically diverse data centers, and they use replication to achieve high availability despite the unreachability of an entire data center. Recent events show that non-crash faults occur in these services and may lead to long outages. While Byzantine-Fault Tolerance (BFT) could be used to withstand these faults, current BFT protocols can become unavailable if a small fraction of their replicas are unreachable. This is because existing BFT protocols favor strong safety guarantees (consistency) over liveness (availability).},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/K6J2UEBK/Singh et al. - Zeno Eventually Consistent Byzantine-Fault Tolera.pdf}
|
||
}
|
||
|
||
@article{somasekaramHighAvailabilityClustersTaxonomy2022,
|
||
title = {High-{{Availability Clusters}}: {{A Taxonomy}}, {{Survey}}, and {{Future Directions}}},
|
||
shorttitle = {High-{{Availability Clusters}}},
|
||
author = {Somasekaram, Premathas and Calinescu, Radu and Buyya, Rajkumar},
|
||
year = 2022,
|
||
month = may,
|
||
journal = {Journal of Systems and Software},
|
||
volume = {187},
|
||
eprint = {2109.15139},
|
||
primaryclass = {cs, eess},
|
||
pages = {111208},
|
||
issn = {01641212},
|
||
doi = {10.1016/j.jss.2021.111208},
|
||
urldate = {2023-06-06},
|
||
abstract = {The delivery of key services in domains ranging from finance and manufacturing to healthcare and transportation is underpinned by a rapidly growing number of mission-critical enterprise applications. Ensuring the continuity of these complex applications requires the use of software-managed infrastructures called high-availability clusters (HACs). HACs employ sophisticated techniques to monitor the health of key enterprise application layers and of the resources they use, and to seamlessly restart or relocate application components after failures. In this paper, we first describe the manifold uses of HACs to protect essential layers of a critical application and present the architecture of high availability clusters. We then propose a taxonomy that covers all key aspects of HACs -- deployment patterns, application areas, types of cluster, topology, cluster management, failure detection and recovery, consistency and integrity, and data synchronisation; and we use this taxonomy to provide a comprehensive survey of the end-to-end software solutions available for the HAC deployment of enterprise applications. Finally, we discuss the limitations and challenges of existing HAC solutions, and we identify opportunities for future research in the area.},
|
||
archiveprefix = {arXiv},
|
||
keywords = {Computer Science - Distributed Parallel and Cluster Computing,Computer Science - Networking and Internet Architecture,Electrical Engineering and Systems Science - Systems and Control},
|
||
file = {/home/alice/Zotero/storage/K3LQZLC8/Somasekaram et al. - 2022 - High-Availability Clusters A Taxonomy, Survey, an.pdf;/home/alice/Zotero/storage/B4KCP9BG/2109.html}
|
||
}
|
||
|
||
@inproceedings{tonkikhSwiperNewParadigm2024,
|
||
title = {Swiper: A New Paradigm for Efficient Weighted Distributed Protocols},
|
||
shorttitle = {Swiper},
|
||
booktitle = {Proceedings of the 43rd {{ACM Symposium}} on {{Principles}} of {{Distributed Computing}}},
|
||
author = {Tonkikh, Andrei and Freitas, Luciano},
|
||
year = 2024,
|
||
month = jun,
|
||
pages = {283--294},
|
||
publisher = {ACM},
|
||
address = {Nantes France},
|
||
doi = {10.1145/3662158.3662799},
|
||
urldate = {2025-03-25},
|
||
abstract = {The majority of fault-tolerant distributed algorithms are designed assuming a nominal corruption model, in which at most a fraction {$fn$} of parties can be corrupted by the adversary. However, due to the infamous Sybil attack, nominal models are not sufficient to express the trust assumptions in open (i.e., permissionless) settings. Instead, permissionless systems typically operate in a weighted model, where each participant is associated with a weight and the adversary can corrupt a set of parties holding at most a fraction {$fw$} of the total weight.},
|
||
isbn = {979-8-4007-0668-4},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/3C6RFGQ3/Tonkikh et Freitas - 2024 - Swiper a new paradigm for efficient weighted distributed protocols.pdf}
|
||
}
|
||
|
||
@inproceedings{tsengDistributedCausalMemory2019,
|
||
title = {Distributed {{Causal Memory}} in the {{Presence}} of {{Byzantine Servers}}},
|
||
booktitle = {2019 {{IEEE}} 18th {{International Symposium}} on {{Network Computing}} and {{Applications}} ({{NCA}})},
|
||
author = {Tseng, Lewis and Wang, Zezhi and Zhao, Yajie and Pan, Haochen},
|
||
year = 2019,
|
||
month = sep,
|
||
pages = {1--8},
|
||
issn = {2643-7929},
|
||
doi = {10.1109/NCA.2019.8935059},
|
||
abstract = {We study distributed causal shared memory (or distributed read/write objects) in the client-server model over asynchronous message-passing networks in which some servers may suffer Byzantine failures. Since Ahamad et al. proposed causal memory in 1994, there have been abundant research on causal storage. Lately, there is a renewed interest in enforcing causal consistency in large-scale distributed storage systems (e.g., COPS, Eiger, Bolt-on). However, to the best of our knowledge, the fault-tolerance aspect of causal memory is not well studied, especially on the tight resilience bound. In our prior work, we showed that 2 f+1 servers is the tight bound to emulate crash-tolerant causal shared memory when up to f servers may crash. In this paper, we adopt a typical model considered in many prior works on Byzantine-tolerant storage algorithms and quorum systems. In the system, up to f servers may suffer Byzantine failures and any number of clients may crash. We constructively present an emulation algorithm for Byzantine causal memory using 3 f+1 servers. We also prove that 3 f+1 is necessary for tolerating up to f Byzantine servers. In other words, we show that 3 f+1 is a tight bound. For evaluation, we implement our algorithm in Golang and compare their performance with two state-of-the-art fault-tolerant algorithms that ensure atomicity in the Google Cloud Platform.},
|
||
keywords = {asynchrony,Byzantine faults,causal memory,Computer crashes,Consensus protocol,distributed storage system,Emulation,evaluation,Fault tolerance,Fault tolerant systems,History,Servers,tight condition},
|
||
file = {/home/alice/Zotero/storage/DDV34ULW/8935059.html}
|
||
}
|
||
|
||
@article{vanderlindePracticalClientsideReplication2020,
|
||
title = {Practical Client-Side Replication: Weak Consistency Semantics for Insecure Settings},
|
||
shorttitle = {Practical Client-Side Replication},
|
||
author = {Van Der Linde, Albert and Leit{\~a}o, Jo{\~a}o and Pregui{\c c}a, Nuno},
|
||
year = 2020,
|
||
month = aug,
|
||
journal = {Proceedings of the VLDB Endowment},
|
||
volume = {13},
|
||
number = {12},
|
||
pages = {2590--2605},
|
||
issn = {2150-8097},
|
||
doi = {10.14778/3407790.3407847},
|
||
urldate = {2023-06-06},
|
||
abstract = {Client-side replication and direct client-to-client synchronization can be used to create highly available, low-latency interactive applications. Causal consistency, the strongest available consistency model under network partitions, is an attractive consistency model for these applications.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/5TJ3SA56/Van Der Linde et al. - 2020 - Practical client-side replication weak consistenc.pdf}
|
||
}
|
||
|
||
@misc{weissLogootUndoDistributedCollaborative2012,
|
||
title = {Logoot-{{Undo Distributed Collaborative Editing System}}},
|
||
author = {Weiss, St{\'e}phane and Urso, Pascal and Molli, Pascal},
|
||
year = 2012,
|
||
month = dec,
|
||
file = {/home/alice/Zotero/storage/PYGQL936/Weiss et al. - 2012 - Logoot-Undo Distributed Collaborative Editing Syst.pdf}
|
||
}
|
||
|
||
@misc{xiaoAgeTrustAoT2024,
|
||
title = {Age of {{Trust}} ({{AoT}}): {{A Continuous Verification Framework}} for {{Wireless Networks}}},
|
||
shorttitle = {Age of {{Trust}} ({{AoT}})},
|
||
author = {Xiao, Yuquan and Du, Qinghe and Cheng, Wenchi and Diamantoulakis, Panagiotis D. and Karagiannidis, George K.},
|
||
year = 2024,
|
||
month = jun,
|
||
number = {arXiv:2406.02190},
|
||
eprint = {2406.02190},
|
||
primaryclass = {eess},
|
||
publisher = {arXiv},
|
||
doi = {10.48550/arXiv.2406.02190},
|
||
urldate = {2025-03-31},
|
||
abstract = {Zero Trust is a new security vision for 6G networks that emphasises the philosophy of never trust and always verify. However, there is a fundamental trade-off between the wireless transmission efficiency and the trust level, which is reflected by the verification interval and its adaptation strategy. More importantly, the mathematical framework to characterise the trust level of the adaptive verification strategy is still missing. Inspired by this vision, we propose a concept called age of trust (AoT) to capture the characteristics of the trust level degrading over time, with the definition of the time elapsed since the last verification of the target user's trust plus the initial age, which depends on the trust level evaluated at that verification. The higher the trust level, the lower the initial age. To evaluate the trust level in the long term, the average AoT is used. We then investigate how to find a compromise between average AoT and wireless transmission efficiency with limited resources. In particular, we address the bi-objective optimization (BOO) problem between average AoT and throughput over a single link with arbitrary service process, where the identity of the receiver is constantly verified, and we devise a periodic verification scheme and a Q-learning-based scheme for constant process and random process, respectively. We also tackle the BOO problem in a multiple random access scenario, where a trust-enhanced frameslotted ALOHA is designed. Finally, the numerical results show that our proposals can achieve a fair compromise between trust level and wireless transmission efficiency, and thus have a wide application prospect in various zero-trust architectures.},
|
||
archiveprefix = {arXiv},
|
||
langid = {english},
|
||
keywords = {Computer Science - Systems and Control,Electrical Engineering and Systems Science - Systems and Control},
|
||
file = {/home/alice/Zotero/storage/CBE5F3IC/Xiao et al. - 2024 - Age of Trust (AoT) A Continuous Verification Framework for Wireless Networks.pdf}
|
||
}
|
||
|
||
@article{xuDistributedEdgeCaching2024,
|
||
title = {Distributed {{Edge Caching}} for {{Zero Trust-Enabled Connected}} and {{Automated Vehicles}}: {{A Multi-Agent Reinforcement Learning Approach}}},
|
||
shorttitle = {Distributed {{Edge Caching}} for {{Zero Trust-Enabled Connected}} and {{Automated Vehicles}}},
|
||
author = {Xu, Xiaolong and Zhou, Xuanhong and Zhou, Xiaokang and Bilal, Muhammad and Qi, Lianyong and Xia, Xiaoyu and Dou, Wanchun},
|
||
year = 2024,
|
||
month = apr,
|
||
journal = {IEEE Wireless Communications},
|
||
volume = {31},
|
||
number = {2},
|
||
pages = {36--41},
|
||
issn = {1536-1284, 1558-0687},
|
||
doi = {10.1109/MWC.001.2300414},
|
||
urldate = {2025-03-31},
|
||
abstract = {Zero Trust model enhances the security of wireless network environments, which is thought to be effectively applicable to Connected and automated vehicles (CAVs). Considering the abundance of real-time data in CAVs and the delay introduced by the data validation of the Zero Trust model, it may result in significant delay when processing real-time data. By caching popular content in advance on edge servers, edge caching can significantly reduce the response delay of real-time data in CAVs. However, achieving low-delay service responses requires ultra-dense deployments of edge servers, which increases the complexity of the wireless network. Therefore, it is challenging to achieve efficient cooperative caching between edge servers in Zero Trust-enabled CAVs. In this article, a Distributed Edge Caching method with Multi-Agent reinforcement learning for Zero Trust-enabled CAVs, named D-ECMA, is proposed. Specifically, a collaboration graph construction method is designed to obtain efficient collaborative relationships. Then a prediction method for the demand of services based on Spatial-Temporal Fusion Graph Neural Networks (STFGNN) is proposed to help edge servers adjust their caching policies. Following, a distributed edge caching method based on Multi-Agent Deep Deterministic Policy Gradient (MADDPG) for Zero Trust-enabled CAVs is designed. Finally, the effectiveness of D-ECMA is demonstrated through comparative experiments.},
|
||
copyright = {https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html}
|
||
}
|
||
|
||
@article{yanFlexibleDataAccess2017,
|
||
title = {Flexible {{Data Access Control Based}} on {{Trust}} and {{Reputation}} in {{Cloud Computing}}},
|
||
author = {Yan, Zheng and Li, Xueyun and Wang, Mingjun and Vasilakos, Athanasios V.},
|
||
year = 2017,
|
||
month = jul,
|
||
journal = {IEEE Transactions on Cloud Computing},
|
||
volume = {5},
|
||
number = {3},
|
||
pages = {485--498},
|
||
issn = {2168-7161},
|
||
doi = {10.1109/TCC.2015.2469662},
|
||
urldate = {2023-12-08},
|
||
abstract = {Cloud computing offers a new way of services and has become a popular service platform. Storing user data at a cloud data center greatly releases storage burden of user devices and brings access convenience. Due to distrust in cloud service providers, users generally store their crucial data in an encrypted form. But in many cases, the data need to be accessed by other entities for fulfilling an expected service, e.g., an eHealth service. How to control personal data access at cloud is a critical issue. Various application scenarios request flexible control on cloud data access based on data owner policies and application demands. Either data owners or some trusted third parties or both should flexibly participate in this control. However, existing work hasn't yet investigated an effective and flexible solution to satisfy this demand. On the other hand, trust plays an important role in data sharing. It helps overcoming uncertainty and avoiding potential risks. But literature still lacks a practical solution to control cloud data access based on trust and reputation. In this paper, we propose a scheme to control data access in cloud computing based on trust evaluated by the data owner and/or reputations generated by a number of reputation centers in a flexible manner by applying Attribue-Based Encryption and Proxy Re-Encryption. We integrate the concept of context-aware trust and reputation evaluation into a cryptographic system in order to support various control scenarios and strategies. The security and performance of our scheme are evaluated and justified through extensive analysis, security proof, comparison and implementation. The results show the efficiency, flexibility and effectiveness of our scheme for data access control in cloud computing.},
|
||
langid = {english},
|
||
file = {/home/alice/Zotero/storage/EGDZNP8U/Yan et al. - 2017 - Flexible Data Access Control Based on Trust and Re.pdf}
|
||
}
|
||
|
||
@misc{YjsYjs2023,
|
||
title = {Yjs/Yjs},
|
||
year = 2023,
|
||
month = dec,
|
||
urldate = {2023-12-10},
|
||
abstract = {Shared data types for building collaborative software},
|
||
howpublished = {Yjs},
|
||
keywords = {collaboration,collaborative-editing,crdt,decentralized,offline-first,p2p,peer-to-peer,realtime,shared-editing,yjs}
|
||
}
|