Hagit Attiya
Sergio Rajsbaum
Skip Abstract Section
Abstract
Diverse examples depict how indistinguishability plays a central role in computer science.
- Angluin, D. Learning regular sets from queries and counterexamples. Inf. Comput. 2, 75 (1987), 87---106.Google Scholar
- Angluin, D. Queries and concept learning. Mach. Learn. 2, 4 (1988), 319---342.Google ScholarDigital Library
- Ross Ashby, W. An Introduction to Cybernetics. John Wiley, New York, 1956.Google ScholarCross Ref
- Attiya, H., Ellen, F. Impossibility Results for Distributed Computing. Morgan & Claypool, 2014, 162.Google Scholar
- Attiya, H., Herzberg, A., Rajsbaum, S. Optimal clock synchronization under different delay assumptions. SIAM J. Comput. 25, 2 (1996), 369---389. Google ScholarDigital Library
- Attiya, H., Ramalingam, G., Rinetzky, N. Sequential verification of serializability. In Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL, ACM, 2010, 31---42Google ScholarDigital Library
- Baltag, A., Bezhanishvili, N., Özgün, A., Smets, S. A topological approach to full belief. J. Philos. Logic 48, 2 (2019), 205---244.Google ScholarCross Ref
- Bernstein, P.A., Hadzilacos, V., Goodman, N. Concurrency Control and Recovery in Database Systems. Addison-Wesley Pub. Co. Inc., Reading, MA, 1987.Google ScholarDigital Library
- 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
- 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=48001Google Scholar
- De Nicola, R. Behavioral Equivalences. Springer US, Boston, MA, 2011, 120---127. Google ScholarCross Ref
- 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
- 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.Google ScholarDigital Library
- Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y. Reasoning About Knowledge. MIT Press, Cambridge, MA, USA, 2003.Google ScholarDigital Library
- Fajstrup, L., Goubault, E., Haucourt, E., Mimram, S., Raussen, M. Directed Algebraic Topology and Concurrency. Springer, Switzerland, 2016.Google ScholarDigital Library
- Fields, C. Bell's Theorem from Moore's Theorem. Cambridge, MA, 2012. arXiv 1201.3672v6. https://arxiv.org/pdf/1201.3672.pdfGoogle Scholar
- van Glabbeek, R.J. The Linear Time---Branching Time Spectrum I. Elsevier, 2001, 3---99.Google Scholar
- 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.Google ScholarCross Ref
- Guerraoui, R., Henzinger, T.A., Vasu, S. Model checking transactional memories. Distrib. Comput. 22, 3 (2010), 129---145.Google ScholarDigital Library
- Halpern, J.Y., Megiddo, N., Munshi, A.A. Optimal precision in the presence of uncertainty. J. Complex. 1, 2 (1985), 170---196. Google ScholarCross Ref
- Harel, D. A grand challenge for computing: Towards full reactive modeling of a multi-cellular animal. Bull. EATCS, 81 (2003), 226---235.Google Scholar
- Herlihy, M., Kozlov, D., Rajsbaum, S. Distributed Computing Through Combinatorial Topology, 1st edn. Elsevier-Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2013.Google ScholarDigital Library
- Hopcroft, J.E., Motwani, R., Ullman, J.D. Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2006.Google ScholarDigital Library
- 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.Google ScholarCross Ref
- Kearns, M.J., Vazirani, U. An Introduction to Computational Learning Theory. MIT Press, Boston, MA, USA, 1994. http://ieeexplore.ieee.org/servlet/opac?bknumber=6267405Google ScholarCross Ref
- Lamport, L. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (1978), 558---565.Google ScholarDigital Library
- McKinsey, J.C.C., Tarski, A. The algebra of topology. Ann. Math. 45, 1 (1944), 141---191. http://www.jstor.org/stable/1969080Google ScholarCross Ref
- Mills, D.L. Computer Network Time Synchronization: The Network Time Protocol on Earth and in Space, 2nd edn. CRC Press, Florida, USA, 2016.Google Scholar
- 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
- 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.Google ScholarDigital Library
- Poizat, B. A Course in Model Theory---An Introduction to Contemporary Mathematical Logic. Springer, NewYork, NY, USA, 2000.Google Scholar
- Ron, D., Rubinfeld, R. Learning fallible deterministic finite automata. Mach. Learn. 2---3, 18 (1995), 149---185. Google ScholarDigital Library
- Rosenberg, A.L. The Pillars of Computation Theory: State, Encoding, Nondeterminism, 1st edn. Springer Publishing Company, Incorporated, 2009.Google Scholar
- Sakakibara, Y. Recent advances of grammatical inference. Theor. Comput. Sci. 1, 185 (1997), 15---45.Google Scholar
- Sangiorgi, D. Introduction to Bisimulation and Coinduction. Cambridge University Press, New York, NY, USA, 2011.Google ScholarCross Ref
- Trakhtenbrot, B.A., Barzdin, Y.M. Finite Automata, Behavior and Synthesis. North Holland, Amsterdam, 1973.Google Scholar
- Vaandrager, F. Model learning. Commun. ACM 2, 60 (2017), 86---95.Google Scholar
- Valiant, L. Probably Approximately Correct: Nature's Algorithms for Learning and Prospering in a Complex World. Basic Books, Inc., New York, 2013.Google ScholarDigital Library
- Weikum, G., Vossen, G. Transactional Information Systems: Theory, Algorithms, and The Practice of Concurrency Control and Recovery. Elsevier, 2001.Google ScholarDigital Library
- Wigderson, A. Mathematics and Computation. Princeton University Press, Princeton, USA, 2018. To appear. https://www.math.ias.edu/avi/bookGoogle Scholar
Index Terms
- Indistinguishability
Recommendations
How to use indistinguishability obfuscation: deniable encryption, and more
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computingWe 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 8209The 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 SecurityAbstract(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