DC FieldValueLanguage
dc.contributor.authorLehnherr, Daviden_US
dc.contributor.authorOgnjanović, Zoranen_US
dc.contributor.authorStuder, Thomasen_US
dc.date.accessioned2021-12-23T12:03:04Z-
dc.date.available2021-12-23T12:03:04Z-
dc.date.issued2022-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4750-
dc.description.abstractWe introduce the probabilistic two-agent justification logic IPJ, a logic in which we can reason about agents that perform interactive proofs. In order to study the growth rate of the probabilities in IPJ, we present a new method of parametrizing IPJ over certain negligible functions. Further, our approach leads to a new notion of zero-knowledge proofs.en_US
dc.publisherSpringer Linken_US
dc.relation.ispartofLogical Foundations of Computer Scienceen_US
dc.relation.ispartofseriesLecture Notes in Computer Scienceen_US
dc.subjectInteractive proof system | Zero-knowledge proof | Epistemic logic | Justification logic | Probabilistic logicen_US
dc.titleA Logic of Interactive Proofsen_US
dc.typeConference Paperen_US
dc.relation.conferenceInternational Symposium on Logical Foundations of Computer Science, LFCS 2022en_US
dc.identifier.doi10.1007/978-3-030-93100-1_10-
dc.identifier.scopus2-s2.0-85122014876-
dc.contributor.affiliationMathematicsen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage143-
dc.relation.lastpage155-
dc.relation.volume13137-
dc.description.rankM33-
item.fulltextNo Fulltext-
item.openairetypeConference Paper-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

1
checked on Apr 3, 2025

Page view(s)

33
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.