Journal articles on the topic 'Interactive proofs'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Interactive proofs.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Bellare, Mihir, Oded Goldreich, and Shafi Goldwasser. "Randomness in interactive proofs." Computational Complexity 3, no. 4 (December 1993): 319–54. http://dx.doi.org/10.1007/bf01275487.
Full textAyala-Rincón, Mauricio, and Thaynara Arielly de Lima. "Teaching Interactive Proofs to Mathematicians." Electronic Proceedings in Theoretical Computer Science 328 (October 30, 2020): 1–17. http://dx.doi.org/10.4204/eptcs.328.1.
Full textBoyar, Joan, Ivan Damgård, and René Peralta. "Short Non-Interactive Cryptographic Proofs." Journal of Cryptology 13, no. 4 (August 10, 2000): 449–72. http://dx.doi.org/10.1007/s001450010011.
Full textGur, Tom, and Ron D. Rothblum. "Non-interactive proofs of proximity." computational complexity 27, no. 1 (June 3, 2016): 99–207. http://dx.doi.org/10.1007/s00037-016-0136-9.
Full textCormode, Graham, Justin Thaler, and Ke Yi. "Verifying computations with streaming interactive proofs." Proceedings of the VLDB Endowment 5, no. 1 (September 2011): 25–36. http://dx.doi.org/10.14778/2047485.2047488.
Full textNishimura, Harumichi, and Tomoyuki Yamakami. "Interactive proofs with quantum finite automata." Theoretical Computer Science 568 (February 2015): 1–18. http://dx.doi.org/10.1016/j.tcs.2014.11.030.
Full textSTRECKER, MARTIN. "Interactive and automated proofs for graph transformations." Mathematical Structures in Computer Science 28, no. 8 (July 27, 2018): 1333–62. http://dx.doi.org/10.1017/s096012951800021x.
Full textBen-Or, Michael, Avinatan Hassidim, and Haran Pilpel. "Quantum Multiprover Interactive Proofs with Communicating Provers." SIAM Journal on Computing 43, no. 3 (January 2014): 987–1011. http://dx.doi.org/10.1137/090777724.
Full textBabai, László. "Bounded Round Interactive Proofs in Finite Groups." SIAM Journal on Discrete Mathematics 5, no. 1 (February 1992): 88–111. http://dx.doi.org/10.1137/0405008.
Full textGalil, Zvi, Stuart Haber, and Moti Yung. "Minimum-Knowledge Interactive Proofs for Decision Problems." SIAM Journal on Computing 18, no. 4 (August 1989): 711–39. http://dx.doi.org/10.1137/0218049.
Full textBoppana, Ravi B., Johan Hastad, and Stathis Zachos. "Does co-NP have short interactive proofs?" Information Processing Letters 25, no. 2 (May 1987): 127–32. http://dx.doi.org/10.1016/0020-0190(87)90232-8.
Full textGoldreich, Oded, Salil Vadhan, and Avi Wigderson. "On interactive proofs with a laconic prover." Computational Complexity 11, no. 1-2 (June 1, 2002): 1–53. http://dx.doi.org/10.1007/s00037-002-0169-0.
Full textBledin, Justin. "Challenging epistemology: Interactive proofs and zero knowledge." Journal of Applied Logic 6, no. 4 (December 2008): 490–501. http://dx.doi.org/10.1016/j.jal.2008.09.002.
Full textWatanabe, Yasunari, Kiran Gopinathan, George Pîrlea, Nadia Polikarpova, and Ilya Sergey. "Certifying the synthesis of heap-manipulating programs." Proceedings of the ACM on Programming Languages 5, ICFP (August 22, 2021): 1–29. http://dx.doi.org/10.1145/3473589.
Full textKrebbers, Robbert, Amin Timany, and Lars Birkedal. "Interactive proofs in higher-order concurrent separation logic." ACM SIGPLAN Notices 52, no. 1 (May 11, 2017): 205–17. http://dx.doi.org/10.1145/3093333.3009855.
Full textFeige, Uriel, Shafi Goldwasser, Laszlo Lovász, Shmuel Safra, and Mario Szegedy. "Interactive proofs and the hardness of approximating cliques." Journal of the ACM 43, no. 2 (March 1996): 268–92. http://dx.doi.org/10.1145/226643.226652.
Full textChlipala, Adam, Gregory Malecha, Greg Morrisett, Avraham Shinnar, and Ryan Wisnesky. "Effective interactive proofs for higher-order imperative programs." ACM SIGPLAN Notices 44, no. 9 (August 31, 2009): 79–90. http://dx.doi.org/10.1145/1631687.1596565.
Full textKempe, Julia, Hirotada Kobayashi, Keiji Matsumoto, and Thomas Vidick. "Using Entanglement in Quantum Multi-Prover Interactive Proofs." computational complexity 18, no. 2 (June 2009): 273–307. http://dx.doi.org/10.1007/s00037-009-0275-3.
Full textIto, Tsuyoshi. "Parallelization of entanglement-resistant multi-prover interactive proofs." Information Processing Letters 114, no. 10 (October 2014): 579–83. http://dx.doi.org/10.1016/j.ipl.2014.05.005.
Full textYamakami, Tomoyuki. "Constant-space quantum interactive proofs against multiple provers." Information Processing Letters 114, no. 11 (November 2014): 611–19. http://dx.doi.org/10.1016/j.ipl.2014.05.012.
Full textAlTawy, Riham, and Guang Gong. "Mesh: A Supply Chain Solution with Locally Private Blockchain Transactions." Proceedings on Privacy Enhancing Technologies 2019, no. 3 (July 1, 2019): 149–69. http://dx.doi.org/10.2478/popets-2019-0041.
Full textGoldreich, Oded, and Johan Håstad. "On the complexity of interactive proofs with bounded communication." Information Processing Letters 67, no. 4 (August 1998): 205–14. http://dx.doi.org/10.1016/s0020-0190(98)00116-1.
Full textKobayashi, Hirotada, François Le Gall, and Harumichi Nishimura. "Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete." SIAM Journal on Computing 44, no. 2 (January 2015): 243–89. http://dx.doi.org/10.1137/140971944.
Full textBitansky, Nir. "Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs." Journal of Cryptology 33, no. 2 (September 4, 2019): 459–93. http://dx.doi.org/10.1007/s00145-019-09331-1.
Full textAndrews, Peter B., and Chad E. Brown. "TPS: A hybrid automatic-interactive system for developing proofs." Journal of Applied Logic 4, no. 4 (December 2006): 367–95. http://dx.doi.org/10.1016/j.jal.2005.10.002.
Full textTang, ChunMing, DingYi Pei, XiaoFeng Wang, and ZhuoJun Liu. "Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs." Science in China Series F: Information Sciences 51, no. 2 (February 2008): 128–44. http://dx.doi.org/10.1007/s11432-008-0003-7.
Full textPham, Tuan Minh, and Yves Bertot. "A Combination of a Dynamic Geometry Software With a Proof Assistant for Interactive Formal Proofs." Electronic Notes in Theoretical Computer Science 285 (September 2012): 43–55. http://dx.doi.org/10.1016/j.entcs.2012.06.005.
Full textLee, Youngkyung, Dong Hoon Lee, and Jong Hwan Park. "Revisiting NIZK-Based Technique for Chosen-Ciphertext Security: Security Analysis and Corrected Proofs." Applied Sciences 11, no. 8 (April 8, 2021): 3367. http://dx.doi.org/10.3390/app11083367.
Full textBabai, László, and Shlomo Moran. "Proving properties of interactive proofs by a generalized counting technique." Information and Computation 82, no. 2 (August 1989): 185–97. http://dx.doi.org/10.1016/0890-5401(89)90053-9.
Full textPavan, A., Alan L. Selman, Samik Sengupta, and N. V. Vinodchandran. "Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy." Theoretical Computer Science 385, no. 1-3 (October 2007): 167–78. http://dx.doi.org/10.1016/j.tcs.2007.06.013.
Full textHayden, Patrick, Kevin Milner, and Mark M. Wilde. "Two-message quantum interactive proofs and the quantum separability problem." Quantum Information and Computation 14, no. 5&6 (May 2014): 384–416. http://dx.doi.org/10.26421/qic14.5-6-2.
Full textBerger, Ulrich, Alison Jones, and Monika Seisenberger. "Program extraction applied to monadic parsing." Journal of Logic and Computation 29, no. 4 (June 6, 2019): 487–518. http://dx.doi.org/10.1093/logcom/exv078.
Full textZhou, Fucai, Yuxi Li, Qingshi Zhou, Jingwei Miao, and Jian Xu. "The electronic cash system based on non-interactive zero-knowledge proofs." International Journal of Computer Mathematics 93, no. 2 (July 15, 2014): 239–57. http://dx.doi.org/10.1080/00207160.2014.933816.
Full textKramer, Simon. "Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer)." ACM Transactions on Computational Logic 16, no. 4 (November 19, 2015): 1–32. http://dx.doi.org/10.1145/2811263.
Full textKramer, Simon. "Logic of Negation-Complete Interactive Proofs (Formal Theory of Epistemic Deciders)." Electronic Notes in Theoretical Computer Science 300 (January 2014): 47–70. http://dx.doi.org/10.1016/j.entcs.2013.12.011.
Full textBaartse, Martijn, and Klaus Meer. "Interactive proofs and a Shamir-like result for real number computations." computational complexity 28, no. 3 (November 7, 2018): 437–69. http://dx.doi.org/10.1007/s00037-018-0174-6.
Full textWANG, B., and Z. SONG. "A non-interactive deniable authentication scheme based on designated verifier proofs." Information Sciences 179, no. 6 (March 1, 2009): 858–65. http://dx.doi.org/10.1016/j.ins.2008.11.011.
Full textBarendregt, Henk, and Freek Wiedijk. "The challenge of computer mathematics." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 363, no. 1835 (September 12, 2005): 2351–75. http://dx.doi.org/10.1098/rsta.2005.1650.
Full textKrebbers, Robbert, Jacques-Henri Jourdan, Ralf Jung, Joseph Tassarotti, Jan-Oliver Kaiser, Amin Timany, Arthur Charguéraud, and Derek Dreyer. "MoSeL: a general, extensible modal framework for interactive proofs in separation logic." Proceedings of the ACM on Programming Languages 2, ICFP (July 30, 2018): 1–30. http://dx.doi.org/10.1145/3236772.
Full textKim, Myungsun, and Hyung Tae Lee. "Experimenting With Non-Interactive Range Proofs Based on the Strong RSA Assumption." IEEE Access 7 (2019): 117505–16. http://dx.doi.org/10.1109/access.2019.2936210.
Full textCoquand, Thierry. "A semantics of evidence for classical arithmetic." Journal of Symbolic Logic 60, no. 1 (March 1995): 325–37. http://dx.doi.org/10.2307/2275524.
Full textMartín-Fernández, Francisco, Pino Caballero-Gil, and Cándido Caballero-Gil. "Authentication Based on Non-Interactive Zero-Knowledge Proofs for the Internet of Things." Sensors 16, no. 1 (January 7, 2016): 75. http://dx.doi.org/10.3390/s16010075.
Full textGoldreich, Oded, and Tom Gur. "Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP." Theoretical Computer Science 878-879 (July 2021): 83–101. http://dx.doi.org/10.1016/j.tcs.2021.05.030.
Full textel Mimouni, Sanae, and Mohamed Bouhdadi. "Event Based Formalization of Communication Properties for an E-Commerce Protocol: An Event-B Approach." International Journal of Engineering Research in Africa 37 (August 2018): 78–90. http://dx.doi.org/10.4028/www.scientific.net/jera.37.78.
Full textSTRUTH, GEORG. "Hoare Semigroups." Mathematical Structures in Computer Science 28, no. 6 (April 4, 2017): 775–99. http://dx.doi.org/10.1017/s096012951700007x.
Full textYuan Zhou and Haifeng Qian. "Practical round-optimal blind signatures without random oracles or non-interactive zero-knowledge proofs." Security and Communication Networks 5, no. 7 (September 1, 2011): 764–75. http://dx.doi.org/10.1002/sec.371.
Full textLee, Ciarán M., and Matty J. Hoban. "Bounds on the power of proofs and advice in general physical theories." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 472, no. 2190 (June 2016): 20160076. http://dx.doi.org/10.1098/rspa.2016.0076.
Full textWang, Hong, and Shi Min Wei. "Public Watermark Detection Resistant to Sensitivity Attacks." Key Engineering Materials 474-476 (April 2011): 1865–68. http://dx.doi.org/10.4028/www.scientific.net/kem.474-476.1865.
Full textMIMRAM, SAMUEL. "The structure of first-order causality." Mathematical Structures in Computer Science 21, no. 1 (January 24, 2011): 65–110. http://dx.doi.org/10.1017/s0960129510000459.
Full textBourke, Timothy, Paul Jeanmaire, Basile Pesin, and Marc Pouzet. "Verified Lustre Normalization with Node Subsampling." ACM Transactions on Embedded Computing Systems 20, no. 5s (October 31, 2021): 1–25. http://dx.doi.org/10.1145/3477041.
Full text