Search

Your search keyword '"Schwarzmann, Alexander A."' showing total 163 results
Start Over Author "Schwarzmann, Alexander A."

Refine your results

more »

more »

more »
163 results on '"Schwarzmann, Alexander A."'

3. The Dynamic Environment

Author

Gramoli, Vincent, Nicolaou, Nicolas, Schwarzmann, Alexander A., Gramoli, Vincent, Nicolaou, Nicolas, and Schwarzmann, Alexander A.

Published
2021
Full Text
View/download PDF

6. The Single-Writer Setting

Author

Gramoli, Vincent, Nicolaou, Nicolas, Schwarzmann, Alexander A., Gramoli, Vincent, Nicolaou, Nicolas, and Schwarzmann, Alexander A.

Published
2021
Full Text
View/download PDF

8. Introduction

Author

Gramoli, Vincent, Nicolaou, Nicolas, Schwarzmann, Alexander A., Gramoli, Vincent, Nicolaou, Nicolas, and Schwarzmann, Alexander A.

Published
2021
Full Text
View/download PDF

9. Model of Computation

Author

Gramoli, Vincent, Nicolaou, Nicolas, Schwarzmann, Alexander A., Gramoli, Vincent, Nicolaou, Nicolas, and Schwarzmann, Alexander A.

Published
2021
Full Text
View/download PDF

10. Unleashing and Speeding Up Readers in Atomic Object Implementations

Author

Georgiou, Chryssis, Hadjistasi, Theophanis, Nicolaou, Nicolas, and Schwarzmann, Alexander A.

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing, C.3.4, C.4
Abstract

Providing efficient emulations of atomic read/write objects in asynchronous, crash-prone, message-passing systems is an important problem in distributed computing. Communication latency is a factor that typically dominates the performance of message-passing systems, consequently the efficiency of algorithms implementing atomic objects is measured in terms of the number of communication exchanges involved in each read and write operation. The seminal result of Attiya, Bar-Noy, and Dolev established that two pairs of communication exchanges, or equivalently two round-trip communications, are sufficient. Subsequent research examined the possibility of implementations that involve less than four exchanges. The work of Dutta et al. showed that for single-writer/multiple-reader (SWMR) settings two exchanges are sufficient, provided that the number of readers is severely constrained with respect to the number of object replicas in the system and the number of replica failures, and also showed that no two exchange implementations of multiple-writer/multiple-reader (MWMR) objects are possible. Later research focused on providing implementations that remove the constraint on the number of readers, while having read and write operations that use variable number of communication exchanges, specifically two, three, or four exchanges. This work presents two advances in the state-of-the-art in this area. Specifically, for SWMR and MWMR systems algorithms are given in which read operations take two or three exchanges. This improves on prior works where read operations took either (a) three exchanges, or (b) two or four exchanges. The number of readers in the new algorithms is unconstrained, and write operations take the same number of exchanges as in prior work (two for SWMR and four for MWMR settings). The correctness of algorithms is rigorously argued., Comment: arXif admin note: substantial text overlap with arXiv:1610.08373

Published
2018

11. The Static Environment

Author

Gramoli, Vincent, Nicolaou, Nicolas, Schwarzmann, Alexander A., Gramoli, Vincent, Nicolaou, Nicolas, and Schwarzmann, Alexander A.

Published
2021
Full Text
View/download PDF

13. Towards a Robust Distributed Framework for Election-Day Voter Check-In

Author

Schwarzmann, Alexander A., Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Johnen, Colette, editor, Schiller, Elad Michael, editor, and Schmid, Stefan, editor

Published
2021
Full Text
View/download PDF

14. Oh-RAM! One and a Half Round Atomic Memory

Author

Hadjistasi, Theophanis, Nicolaou, Nicolas, and Schwarzmann, Alexander A.

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

Emulating atomic read/write shared objects in a message-passing system is a fundamental problem in distributed computing. Considering that network communication is the most expensive resource, efficiency is measured first of all in terms of the communication needed to implement read and write operations. It is well known that 2 communication round-trip phases involving in total 4 message exchanges are sufficient to implemented atomic operations. It is also known that under certain constraints on the number of readers with respect to the numbers of replica servers and failures it is possible to implement single-writer atomic objects such that each operation involves one round-trip phase. We present algorithms that allow operations to complete in 3 communication exchanges without imposing any constraints on the number of readers and writers. Specifically, we present an atomic memory implementation for the SWMR setting, where reads complete in 3 communication exchanges and writes complete in 2 exchanges. We pose the question of whether it is possible to implement MWMR memory where operations complete in at most 3 communication exchanges. We answer this question in the negative by showing that an atomic memory implementation is impossible if both read and write operations take 3 communication exchanges, even when assuming two writers, two readers, and a single replica server failure. Motivated by this impossibility result, we provide a MWMR atomic memory implementation where reads involve 3 and writes 4 communication exchanges. In light of our impossibility result these algorithms are optimal in terms of the number of communication exchanges. We rigorously reason about the correctness of the algorithms., Comment: A Brief Announcement related to this work was presented at ACM PODC, 2016

Published
2016

15. Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems

Author

Konwar, Kishori M., Prakash, N., Kantor, Erez, Lynch, Nancy, Medard, Muriel, and Schwarzmann, Alexander A.

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Information Theory
Abstract

Erasure codes are increasingly being studied in the context of implementing atomic memory objects in large scale asynchronous distributed storage systems. When compared with the traditional replication based schemes, erasure codes have the potential of significantly lowering storage and communication costs while simultaneously guaranteeing the desired resiliency levels. In this work, we propose the Storage-Optimized Data-Atomic (SODA) algorithm for implementing atomic memory objects in the multi-writer multi-reader setting. SODA uses Maximum Distance Separable (MDS) codes, and is specifically designed to optimize the total storage cost for a given fault-tolerance requirement. For tolerating $f$ server crashes in an $n$-server system, SODA uses an $[n, k]$ MDS code with $k=n-f$, and incurs a total storage cost of $\frac{n}{n-f}$. SODA is designed under the assumption of reliable point-to-point communication channels. The communication cost of a write and a read operation are respectively given by $O(f^2)$ and $\frac{n}{n-f}(\delta_w+1)$, where $\delta_w$ denotes the number of writes that are concurrent with the particular read. In comparison with the recent CASGC algorithm, which also uses MDS codes, SODA offers lower storage cost while pays more on the communication cost. We also present a modification of SODA, called SODA$_{\text{err}}$, to handle the case where some of the servers can return erroneous coded elements during a read operation. Specifically, in order to tolerate $f$ server failures and $e$ error-prone coded elements, the SODA$_{\text{err}}$ algorithm uses an $[n, k]$ MDS code such that $k=n-2e-f$. SODA$_{\text{err}}$ also guarantees liveness and atomicity, while maintaining an optimized total storage cost of $\frac{n}{n-f-2e}$., Comment: Accepted for Publication at IEEE IPDPS, 2016

Published
2016
Full Text
View/download PDF

17. Unleashing and Speeding Up Readers in Atomic Object Implementations

Author

Georgiou, Chryssis, Hadjistasi, Theophanis, Nicolaou, Nicolas, Schwarzmann, Alexander A., Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Podelski, Andreas, editor, and Taïani, François, editor

Published
2019
Full Text
View/download PDF

18. Doing-it-All with Bounded Work and Communication

Author

Chlebus, Bogdan S., Gąsieniec, Leszek, Kowalski, Dariusz R., and Schwarzmann, Alexander A.

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

We consider the Do-All problem, where $p$ cooperating processors need to complete $t$ similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is measured in terms of work complexity (also known as total available processor steps) and communication complexity (total number of point-to-point messages). When work and communication are considered to be comparable resources, then the overall efficiency is meaningfully expressed in terms of effort defined as work + communication. We develop and analyze a constructive algorithm that has work $O( t + p \log p\, (\sqrt{p\log p}+\sqrt{t\log t}\, ) )$ and a nonconstructive algorithm that has work $O(t +p \log^2 p)$. The latter result is close to the lower bound $\Omega(t + p \log p/ \log \log p)$ on work. The effort of each of these algorithms is proportional to its work when the number of crashes is bounded above by $c\,p$, for some positive constant $c < 1$. We also present a nonconstructive algorithm that has effort $O(t + p ^{1.77})$.

Published
2014
Full Text
View/download PDF

20. Oh-RAM! One and a Half Round Atomic Memory

Author

Hadjistasi, Theophanis, Nicolaou, Nicolas, Schwarzmann, Alexander A., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, El Abbadi, Amr, editor, and Garbinato, Benoît, editor

Published
2017
Full Text
View/download PDF

27. Tractable low-delay atomic memory

Author

Anta, Antonio Fernández, primary, Hadjistasi, Theophanis, additional, Nicolaou, Nicolas, additional, Popa, Alexandru, additional, and Schwarzmann, Alexander A., additional

Published
2020
Full Text
View/download PDF

29. Consistent Distributed Memory Services: Resilience and Efficiency (Invited Paper)

Author

Hadjistasi, Theophanis and Schwarzmann, Alexander A.

Subjects
000 Computer science, knowledge, general works, Computer Science
Abstract

Reading, 'Riting, and 'Rithmetic, the three R's underlying much of human intellectual activity, not surprisingly, also stand as a venerable foundation of modern computing technology. Indeed, both the Turing machine and von Neumann machine models operate by reading, writing, and computing, and all practical uniprocessor implementations are based on performing activities structured in terms of the three R's. With the advance of networking technology, communication became an additional major systemic activity. However, at a high level of abstraction, it is apparently still more natural to think in terms of reading, writing, and computing. While it is hard to imagine distributed systems - such as those implementing the World-Wide Web - without communication, we often imagine browser-based applications that operate by retrieving (i.e., reading) data, performing computation, and storing (i.e., writing) the results. In this article, we deal with the storage of shared readable and writable data in distributed systems that are subject to perturbations in the underlying distributed platforms composed of computers and networks that interconnect them. The perturbations may include permanent failures (or crashes) of individual computers, transient failures, and delays in the communication medium. The focus of this paper is on the implementations of distributed atomic memory services. Atomicity is a venerable notion of consistency, introduced in 1979 by Lamport [Lamport, 1979]. To this day atomicity remains the most natural type of consistency because it provides an illusion of equivalence with the serial object type that software designers expect. We define the overall setting, models of computation, definition of atomic consistency, and measures of efficiency. We then present algorithms for single-writer settings in the static models. Then we move to presenting algorithms for multi-writer settings. For both static settings we discuss design issues, correctness, efficiency, and trade-offs. Lastly we survey the implementation issues in dynamic settings, where the universe of participants may completely change over time. Here the expectation is that solutions are found by integrating static algorithms with a reconfiguration framework so that during periods of relative stability one benefits from the efficiency of static algorithms, and where during the more turbulent times performance degrades gracefully when reconfigurations are needed. We describe the most important approaches and provide examples.

Published
2018
Full Text
View/download PDF

32. Brief Announcement

Author

Hadjistasi, Theophanis, primary, Nicolaou, Nicolas, additional, and Schwarzmann, Alexander A., additional

Published
2016
Full Text
View/download PDF

34. CTA: Confidential Transactions Protocol with State Accumulator

Author

Si, Shumin, Wei, Puwen, Lin, Xiuhan, Liu, Li, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

35. Dually Computable Cryptographic Accumulators and Their Application to Attribute Based Encryption

Author

Barthoulot, Anaïs, Blazy, Olivier, Canard, Sébastien, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

36. A Practical Forward-Secure DualRing

Author

Li, Nan, Li, Yingjiu, Miyaji, Atsuko, Tian, Yangguang, Yuen, Tsz Hon, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

39. A Plug-n-Play Framework for Scaling Private Set Intersection to Billion-Sized Sets

Author

Badrinarayanan, Saikrishna, Kumaresan, Ranjit, Christodorescu, Mihai, Nagaraja, Vinjith, Patel, Karan, Raghuraman, Srinivasan, Rindal, Peter, Sun, Wei, Xu, Minghua, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

40. New Techniques for Modeling SBoxes: An MILP Approach

Author

Pal, Debranjan, Chandratreya, Vishal Pankaj, Chowdhury, Dipanwita Roy, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

41. Lower Bounds on the Share Size of Leakage Resilient Cheating Detectable Secret Sharing

Author

Dutta, Sabyasachi, Jiang, Shaoquan, Safavi-Naini, Reihaneh, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

42. Compact Stateful Deterministic Wallet from Isogeny-Based Signature Featuring Uniquely Rerandomizable Public Keys

Author

Shaw, Surbhi, Dutta, Ratna, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

43. Differential Cryptanalysis with SAT, SMT, MILP, and CP: A Detailed Comparison for Bit-Oriented Primitives

Author

Bellini, Emanuele, De Piccoli, Alessandro, Formenti, Mattia, Gerault, David, Huynh, Paul, Pelizzola, Simone, Polese, Sergio, Visconti, Andrea, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

44. Improving Privacy of Anonymous Proof-of-Stake Protocols

Author

Wu, Shichen, Song, Zhiying, Wei, Puwen, Tang, Peng, Yuan, Quan, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

45. LucidiTEE: Scalable Policy-Based Multiparty Computation with Fairness

Author

Gaddam, Sivanarayana, Kumaresan, Ranjit, Raghuraman, Srinivasan, Sinha, Rohit, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

46. Key Filtering in Cube Attacks from the Implementation Aspect

Author

Fan, Hao, Hao, Yonglin, Wang, Qingju, Gong, Xinxin, Jiao, Lin, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

47. Free-XOR in Card-Based Garbled Circuits

Author

Manabe, Yoshifumi, Shinagawa, Kazumasa, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

48. Exploiting Android Browser

Author

Kar, Animesh, Stakhanova, Natalia, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

50. How to Enumerate LWE Keys as Narrow as in Kyber/Dilithium

Author

Glaser, Timo, May, Alexander, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results