Attiya, H., Ramalingam, G., Rinetzky, N. Sequential verification of serializability. In Proceedings of the 37^th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL, ACM, 2010, 31---42

Digital Library

Google Scholar

[7]

Baltag, A., Bezhanishvili, N., Özgün, A., Smets, S. A topological approach to full belief. J. Philos. Logic 48, 2 (2019), 205---244.

Crossref

Google Scholar

[8]

Bernstein, P.A., Hadzilacos, V., Goodman, N. Concurrency Control and Recovery in Database Systems. Addison-Wesley Pub. Co. Inc., Reading, MA, 1987.

Digital Library

Google Scholar

[9]

Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H. Counterexample-guided abstraction refinement. In LNCS-Computer Aided Verification. E. Allen Emerson and A.P. Sistla, eds. Volume 1855. Springer Berlin, Heidelberg, Berlin, Heidelberg, 2000, 154---169.

Google Scholar

[10]

Coquidé, C., Georgeot, B., Giraud, O. Distinguishing humans from computers in the game of go: A complex network approach. Europhys. Lett. 4, 119 (2017), 48001. http://stacks.iop.org/0295-5075/119/i=4/a=48001

Google Scholar

[11]

De Nicola, R. Behavioral Equivalences. Springer US, Boston, MA, 2011, 120---127.

Crossref

Google Scholar

[12]

Edward, M. Gedanken-experiments on sequential machines. In Automata Studies. C.E. Shannon and J. McCarthy, eds. Number 34 in Annals of Mathematics Studies. Princeton University Press, Princeton, 1958, 129---153.

Google Scholar

[13]

Eswaran, K.P., Gray, J.N., Lorie, R.A., Traiger, I.L. The notions of consistency and predicate locks in a database system. Commun. ACM 19, 11 (1976), 624---633.

Digital Library

Google Scholar

[14]

Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y. Reasoning About Knowledge. MIT Press, Cambridge, MA, USA, 2003.

Digital Library

Google Scholar

[15]

Fajstrup, L., Goubault, E., Haucourt, E., Mimram, S., Raussen, M. Directed Algebraic Topology and Concurrency. Springer, Switzerland, 2016.

Digital Library

Google Scholar

[16]

Fields, C. Bell's Theorem from Moore's Theorem. Cambridge, MA, 2012. arXiv 1201.3672v6. https://arxiv.org/pdf/1201.3672.pdf

Google Scholar

[17]

van Glabbeek, R.J. The Linear Time---Branching Time Spectrum I. Elsevier, 2001, 3---99.

Google Scholar

[18]

Goubault, E., Ledent, J., Rajsbaum, S. A simplicial complex model for dynamic epistemic logic to study distributed task computability. In Proceedings 9th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF) (EPTCS). A. Orlandini and M. Zimmermann, eds. Volume 277, Electronic Proceedings in Theoretical Computer Science, 2018, 73---87.

Crossref

Google Scholar

[19]

Guerraoui, R., Henzinger, T.A., Vasu, S. Model checking transactional memories. Distrib. Comput. 22, 3 (2010), 129---145.

Digital Library

Google Scholar

[20]

Halpern, J.Y., Megiddo, N., Munshi, A.A. Optimal precision in the presence of uncertainty. J. Complex. 1, 2 (1985), 170---196.

Crossref

Google Scholar

[21]

Harel, D. A grand challenge for computing: Towards full reactive modeling of a multi-cellular animal. Bull. EATCS, 81 (2003), 226---235.

Google Scholar

[22]

Herlihy, M., Kozlov, D., Rajsbaum, S. Distributed Computing Through Combinatorial Topology, 1^st edn. Elsevier-Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2013.

Digital Library

Google Scholar

[23]

Hopcroft, J.E., Motwani, R., Ullman, J.D. Introduction to Automata Theory, Languages, and Computation, 3^rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2006.

Digital Library

Google Scholar

[24]

Isberner, M., Howar, F., Steffen, B. The TTT algorithm: A redundancy-free approach to active automata learning. In Runtime Verification (LNCS). B. Bonakdarpour and S.A. Smolka, eds. Volume 8734. Springer International Publishing, Cham, 2014, 307---322.

Crossref

Google Scholar

[25]

Kearns, M.J., Vazirani, U. An Introduction to Computational Learning Theory. MIT Press, Boston, MA, USA, 1994. http://ieeexplore.ieee.org/servlet/opac?bknumber=6267405

Crossref

Google Scholar

[26]

Lamport, L. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (1978), 558---565.

Digital Library

Google Scholar

[27]

McKinsey, J.C.C., Tarski, A. The algebra of topology. Ann. Math. 45, 1 (1944), 141---191. http://www.jstor.org/stable/1969080

Crossref

Google Scholar

[28]

Mills, D.L. Computer Network Time Synchronization: The Network Time Protocol on Earth and in Space, 2^nd edn. CRC Press, Florida, USA, 2016.

Google Scholar

[29]

Moses, Y. Relating knowledge and coordinated action: The knowledge of preconditions principle. In Proceedings of the Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2015, Carnegie Mellon University, Pittsburgh, USA, June 4---6, 2015, 231---245.

Google Scholar

[30]

Patt-Shamir, B., Rajsbaum, S. A theory of clock synchronization (extended abstract). In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing (STOC '94). 1994, 810---819.

Digital Library

Google Scholar

[31]

Poizat, B. A Course in Model Theory---An Introduction to Contemporary Mathematical Logic. Springer, NewYork, NY, USA, 2000.

Google Scholar

[32]

Ron, D., Rubinfeld, R. Learning fallible deterministic finite automata. Mach. Learn. 2---3, 18 (1995), 149---185.

Digital Library

Google Scholar

[33]

Rosenberg, A.L. The Pillars of Computation Theory: State, Encoding, Nondeterminism, 1st edn. Springer Publishing Company, Incorporated, 2009.

Google Scholar

[34]

Sakakibara, Y. Recent advances of grammatical inference. Theor. Comput. Sci. 1, 185 (1997), 15---45.

Google Scholar

[35]

Sangiorgi, D. Introduction to Bisimulation and Coinduction. Cambridge University Press, New York, NY, USA, 2011.

Crossref

Google Scholar

[36]

Trakhtenbrot, B.A., Barzdin, Y.M. Finite Automata, Behavior and Synthesis. North Holland, Amsterdam, 1973.

Google Scholar

[37]

Vaandrager, F. Model learning. Commun. ACM 2, 60 (2017), 86---95.

Google Scholar

[38]

Valiant, L. Probably Approximately Correct: Nature's Algorithms for Learning and Prospering in a Complex World. Basic Books, Inc., New York, 2013.

Digital Library

Google Scholar

[39]

Weikum, G., Vossen, G. Transactional Information Systems: Theory, Algorithms, and The Practice of Concurrency Control and Recovery. Elsevier, 2001.

Digital Library

Google Scholar

[40]

Wigderson, A. Mathematics and Computation. Princeton University Press, Princeton, USA, 2018. To appear. https://www.math.ias.edu/avi/book

Google Scholar

Cited By

View all

Raynal M(2025)Invited Paper: Distributed Computability: A Few Results Masters Students Should KnowDistributed Computing and Intelligent Technology10.1007/978-3-031-81404-4_3(24-44)Online publication date: 8-Jan-2025
https://dl.acm.org/doi/10.1007/978-3-031-81404-4_3
Rajsbaum S(2023)A distributed computing perspective of unconditionally secure information transmission in Russian cards problemsTheoretical Computer Science10.1016/j.tcs.2023.113761952(113761)Online publication date: Mar-2023
https://doi.org/10.1016/j.tcs.2023.113761
Raynal M(2023)A Short Visit to Distributed Computing Where Simplicity Is Considered a First Class PropertyThe French School of Programming10.1007/978-3-031-34518-0_3(47-67)Online publication date: 11-Oct-2023
https://doi.org/10.1007/978-3-031-34518-0_3
Show More Cited By

Index Terms

Indistinguishability
1. Theory of computation
  1. Computational complexity and cryptography
  2. Design and analysis of algorithms

Recommendations

How to use indistinguishability obfuscation: deniable encryption, and more
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing

We introduce a new technique, that we call punctured programs, to apply indistinguishability obfuscation towards cryptographic problems. We use this technique to carry out a systematic study of the applicability of indistinguishability obfuscation to a ...
Indistinguishability against Chosen Ciphertext Verification Attack Revisited: The Complete Picture
ProvSec 2013: Proceedings of the 7th International Conference on Provable Security - Volume 8209

The knowledge that whether a purported ciphertext is valid or not may leak sufficient information to mount practical attacks on public key cryptosystem, e.g., Bleichenbacher's attack on RSA-PKCS#1, Hall-Goldberg-Schneier's "reaction attack" on both ...
Keyed-Fully Homomorphic Encryption Without Indistinguishability Obfuscation
Applied Cryptography and Network Security
Abstract
(Fully) homomorphic encryption ((F)HE) allows users to publicly evaluate circuits on encrypted data. Although public homomorphic evaluation property has various applications, (F)HE cannot achieve security against chosen ciphertext attacks (CCA2) ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 63, Issue 5

May 2020

101 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/3396208

Editor:
Andrew A. Chien
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 April 2020

Published in CACM Volume 63, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Review-article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
5,307
Total Downloads

Downloads (Last 12 months)462
Downloads (Last 6 weeks)86

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Raynal M(2025)Invited Paper: Distributed Computability: A Few Results Masters Students Should KnowDistributed Computing and Intelligent Technology10.1007/978-3-031-81404-4_3(24-44)Online publication date: 8-Jan-2025
https://dl.acm.org/doi/10.1007/978-3-031-81404-4_3
Rajsbaum S(2023)A distributed computing perspective of unconditionally secure information transmission in Russian cards problemsTheoretical Computer Science10.1016/j.tcs.2023.113761952(113761)Online publication date: Mar-2023
https://doi.org/10.1016/j.tcs.2023.113761
Raynal M(2023)A Short Visit to Distributed Computing Where Simplicity Is Considered a First Class PropertyThe French School of Programming10.1007/978-3-031-34518-0_3(47-67)Online publication date: 11-Oct-2023
https://doi.org/10.1007/978-3-031-34518-0_3
Krishna SGodbole AMeyer RChakraborty SMilani AWoelfel P(2022)Parameterized Verification under Release Acquire is PSPACE-completeProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538445(482-492)Online publication date: 20-Jul-2022
https://dl.acm.org/doi/10.1145/3519270.3538445
Fraigniaud PPaz ARajsbaum SMilani AWoelfel P(2022)A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate AgreementProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538422(460-470)Online publication date: 20-Jul-2022
https://dl.acm.org/doi/10.1145/3519270.3538422
Raynal M(2021)Distributed ComputabilityACM SIGACT News10.1145/3471469.347148452:2(92-110)Online publication date: 14-Jun-2021
https://dl.acm.org/doi/10.1145/3471469.3471484
Leyva-Acosta ZPascual-Aseff ERajsbaum S(2021)Information Exchange in the Russian Cards ProblemStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-91081-5_25(380-394)Online publication date: 17-Nov-2021
https://dl.acm.org/doi/10.1007/978-3-030-91081-5_25
Rajsbaum S(2021)A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards ProblemsStructural Information and Communication Complexity10.1007/978-3-030-79527-6_16(277-295)Online publication date: 28-Jun-2021
https://dl.acm.org/doi/10.1007/978-3-030-79527-6_16

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

How to use indistinguishability obfuscation: deniable encryption, and more

Indistinguishability against Chosen Ciphertext Verification Attack Revisited: The Complete Picture

Keyed-Fully Homomorphic Encryption Without Indistinguishability Obfuscation

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations