Batch Proofs Are Statistically Hiding Article Swipe
Nir Bitansky
,
Chethan Kamath
,
Omer Paneth
,
Ron D. Rothblum
,
Prashant Nalini Vasudevan
·
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.1145/3618260.3649775
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.1145/3618260.3649775
Batch proofs are proof systems that convince a verifier that x1,…,xt ∈ L, for some NP language L, with communication that is much shorter than sending the t witnesses. In the case of statistical soundness (where the cheating prover is unbounded but the honest prover is efficient given the witnesses), interactive batch proofs are known for UP, the class of unique-witness NP languages. In the case of computational soundness (where both honest and dishonest provers are efficient), non-interactive solutions are now known for all of NP, assuming standard lattice or group assumptions. We exhibit the first negative results regarding the existence of batch proofs and arguments: - Statistically sound batch proofs for L imply that L has a statistically witness indistinguishable (SWI) proof, with inverse polynomial SWI error, and a non-uniform honest prover. The implication is unconditional for obtaining honest-verifier SWI or for obtaining full-fledged SWI from public-coin protocols, whereas for private-coin protocols full-fledged SWI is obtained assuming one-way functions. This poses a barrier for achieving batch proofs beyond UP (where witness indistinguishability is trivial). In particular, assuming that NP does not have SWI proofs, batch proofs for all of NP do not exist. - Computationally sound batch proofs (a.k.a batch arguments or BARGs) for NP, together with one-way functions, imply statistical zero-knowledge (SZK) arguments for NP with roughly the same number of rounds, an inverse polynomial zero-knowledge error, and non-uniform honest prover. Thus, constant-round interactive BARGs from one-way functions would yield constant-round SZK arguments from one-way functions. This would be surprising as SZK arguments are currently only known assuming constant-round statistically-hiding commitments. We further prove new positive implications of non-interactive batch arguments to non-interactive zero knowledge arguments (with explicit uniform prover and verifier): - Non-interactive BARGs for NP, together with one-way functions, imply non-interactive computational zero-knowledge arguments for NP. Assuming also dual-mode commitments, the zero knowledge can be made statistical. Both our negative and positive results stem from a new framework showing how to transform a batch protocol for a language L into an SWI protocol for L.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1145/3618260.3649775
- https://dl.acm.org/doi/pdf/10.1145/3618260.3649775
- OA Status
- gold
- Cited By
- 7
- References
- 54
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4399522305
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4399522305Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1145/3618260.3649775Digital Object Identifier
- Title
-
Batch Proofs Are Statistically HidingWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-06-10Full publication date if available
- Authors
-
Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini VasudevanList of authors in order
- Landing page
-
https://doi.org/10.1145/3618260.3649775Publisher landing page
- PDF URL
-
https://dl.acm.org/doi/pdf/10.1145/3618260.3649775Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://dl.acm.org/doi/pdf/10.1145/3618260.3649775Direct OA link when available
- Concepts
-
Gas meter prover, Soundness, Mathematical proof, Zero-knowledge proof, Computer science, Mathematics, Discrete mathematics, Theoretical computer science, Programming language, GeometryTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
7Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 5, 2024: 2Per-year citation counts (last 5 years)
- References (count)
-
54Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4399522305 |
|---|---|
| doi | https://doi.org/10.1145/3618260.3649775 |
| ids.doi | https://doi.org/10.1145/3618260.3649775 |
| ids.openalex | https://openalex.org/W4399522305 |
| fwci | 4.47144984 |
| type | article |
| title | Batch Proofs Are Statistically Hiding |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 443 |
| biblio.first_page | 435 |
| topics[0].id | https://openalex.org/T10237 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998999834060669 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Cryptography and Data Security |
| topics[1].id | https://openalex.org/T10720 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.998199999332428 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1703 |
| topics[1].subfield.display_name | Computational Theory and Mathematics |
| topics[1].display_name | Complexity and Algorithms in Graphs |
| topics[2].id | https://openalex.org/T10764 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9966999888420105 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Privacy-Preserving Technologies in Data |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C159718280 |
| concepts[0].level | 3 |
| concepts[0].score | 0.9373571872711182 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q5526353 |
| concepts[0].display_name | Gas meter prover |
| concepts[1].id | https://openalex.org/C39920170 |
| concepts[1].level | 2 |
| concepts[1].score | 0.909153163433075 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q693083 |
| concepts[1].display_name | Soundness |
| concepts[2].id | https://openalex.org/C108710211 |
| concepts[2].level | 2 |
| concepts[2].score | 0.9003153443336487 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q11538 |
| concepts[2].display_name | Mathematical proof |
| concepts[3].id | https://openalex.org/C176329583 |
| concepts[3].level | 3 |
| concepts[3].score | 0.6139413118362427 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q191943 |
| concepts[3].display_name | Zero-knowledge proof |
| concepts[4].id | https://openalex.org/C41008148 |
| concepts[4].level | 0 |
| concepts[4].score | 0.5481165647506714 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[4].display_name | Computer science |
| concepts[5].id | https://openalex.org/C33923547 |
| concepts[5].level | 0 |
| concepts[5].score | 0.4391823709011078 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[5].display_name | Mathematics |
| concepts[6].id | https://openalex.org/C118615104 |
| concepts[6].level | 1 |
| concepts[6].score | 0.4257068932056427 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q121416 |
| concepts[6].display_name | Discrete mathematics |
| concepts[7].id | https://openalex.org/C80444323 |
| concepts[7].level | 1 |
| concepts[7].score | 0.4068233370780945 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[7].display_name | Theoretical computer science |
| concepts[8].id | https://openalex.org/C199360897 |
| concepts[8].level | 1 |
| concepts[8].score | 0.1635228991508484 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[8].display_name | Programming language |
| concepts[9].id | https://openalex.org/C2524010 |
| concepts[9].level | 1 |
| concepts[9].score | 0.0 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[9].display_name | Geometry |
| keywords[0].id | https://openalex.org/keywords/gas-meter-prover |
| keywords[0].score | 0.9373571872711182 |
| keywords[0].display_name | Gas meter prover |
| keywords[1].id | https://openalex.org/keywords/soundness |
| keywords[1].score | 0.909153163433075 |
| keywords[1].display_name | Soundness |
| keywords[2].id | https://openalex.org/keywords/mathematical-proof |
| keywords[2].score | 0.9003153443336487 |
| keywords[2].display_name | Mathematical proof |
| keywords[3].id | https://openalex.org/keywords/zero-knowledge-proof |
| keywords[3].score | 0.6139413118362427 |
| keywords[3].display_name | Zero-knowledge proof |
| keywords[4].id | https://openalex.org/keywords/computer-science |
| keywords[4].score | 0.5481165647506714 |
| keywords[4].display_name | Computer science |
| keywords[5].id | https://openalex.org/keywords/mathematics |
| keywords[5].score | 0.4391823709011078 |
| keywords[5].display_name | Mathematics |
| keywords[6].id | https://openalex.org/keywords/discrete-mathematics |
| keywords[6].score | 0.4257068932056427 |
| keywords[6].display_name | Discrete mathematics |
| keywords[7].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[7].score | 0.4068233370780945 |
| keywords[7].display_name | Theoretical computer science |
| keywords[8].id | https://openalex.org/keywords/programming-language |
| keywords[8].score | 0.1635228991508484 |
| keywords[8].display_name | Programming language |
| language | en |
| locations[0].id | doi:10.1145/3618260.3649775 |
| locations[0].is_oa | True |
| locations[0].source | |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://dl.acm.org/doi/pdf/10.1145/3618260.3649775 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | proceedings-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Proceedings of the 56th Annual ACM Symposium on Theory of Computing |
| locations[0].landing_page_url | https://doi.org/10.1145/3618260.3649775 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5065373891 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-8361-6035 |
| authorships[0].author.display_name | Nir Bitansky |
| authorships[0].countries | IL |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I16391192 |
| authorships[0].affiliations[0].raw_affiliation_string | Tel Aviv University, Tel Aviv, Israel |
| authorships[0].institutions[0].id | https://openalex.org/I16391192 |
| authorships[0].institutions[0].ror | https://ror.org/04mhzgx49 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I16391192 |
| authorships[0].institutions[0].country_code | IL |
| authorships[0].institutions[0].display_name | Tel Aviv University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Nir Bitansky |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Tel Aviv University, Tel Aviv, Israel |
| authorships[1].author.id | https://openalex.org/A5012769677 |
| authorships[1].author.orcid | https://orcid.org/0009-0006-6812-7317 |
| authorships[1].author.display_name | Chethan Kamath |
| authorships[1].countries | IN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I162827531 |
| authorships[1].affiliations[0].raw_affiliation_string | IIT Bombay, Mumbai, India |
| authorships[1].institutions[0].id | https://openalex.org/I162827531 |
| authorships[1].institutions[0].ror | https://ror.org/02qyf5152 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I162827531 |
| authorships[1].institutions[0].country_code | IN |
| authorships[1].institutions[0].display_name | Indian Institute of Technology Bombay |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Chethan Kamath |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | IIT Bombay, Mumbai, India |
| authorships[2].author.id | https://openalex.org/A5035828031 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-8561-1123 |
| authorships[2].author.display_name | Omer Paneth |
| authorships[2].countries | IL |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I16391192 |
| authorships[2].affiliations[0].raw_affiliation_string | Tel Aviv University, Tel Aviv, Israel |
| authorships[2].institutions[0].id | https://openalex.org/I16391192 |
| authorships[2].institutions[0].ror | https://ror.org/04mhzgx49 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I16391192 |
| authorships[2].institutions[0].country_code | IL |
| authorships[2].institutions[0].display_name | Tel Aviv University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Omer Paneth |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Tel Aviv University, Tel Aviv, Israel |
| authorships[3].author.id | https://openalex.org/A5049757682 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-5481-7276 |
| authorships[3].author.display_name | Ron D. Rothblum |
| authorships[3].countries | IL |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I174306211 |
| authorships[3].affiliations[0].raw_affiliation_string | Technion, Haifa, Israel |
| authorships[3].institutions[0].id | https://openalex.org/I174306211 |
| authorships[3].institutions[0].ror | https://ror.org/03qryx823 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I174306211 |
| authorships[3].institutions[0].country_code | IL |
| authorships[3].institutions[0].display_name | Technion – Israel Institute of Technology |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Ron D. Rothblum |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Technion, Haifa, Israel |
| authorships[4].author.id | https://openalex.org/A5032319697 |
| authorships[4].author.orcid | https://orcid.org/0000-0001-6880-795X |
| authorships[4].author.display_name | Prashant Nalini Vasudevan |
| authorships[4].countries | SG |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I165932596 |
| authorships[4].affiliations[0].raw_affiliation_string | National University of Singapore, Singapore, Singapore |
| authorships[4].institutions[0].id | https://openalex.org/I165932596 |
| authorships[4].institutions[0].ror | https://ror.org/01tgyzw49 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I165932596 |
| authorships[4].institutions[0].country_code | SG |
| authorships[4].institutions[0].display_name | National University of Singapore |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Prashant Nalini Vasudevan |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | National University of Singapore, Singapore, Singapore |
| has_content.pdf | True |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://dl.acm.org/doi/pdf/10.1145/3618260.3649775 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Batch Proofs Are Statistically Hiding |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10237 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998999834060669 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Cryptography and Data Security |
| related_works | https://openalex.org/W2950202488, https://openalex.org/W2604424424, https://openalex.org/W2466303427, https://openalex.org/W2149634854, https://openalex.org/W2809883875, https://openalex.org/W1970588133, https://openalex.org/W4386880013, https://openalex.org/W2157568248, https://openalex.org/W1567449721, https://openalex.org/W2146325043 |
| cited_by_count | 7 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 5 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 2 |
| locations_count | 1 |
| best_oa_location.id | doi:10.1145/3618260.3649775 |
| best_oa_location.is_oa | True |
| best_oa_location.source | |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://dl.acm.org/doi/pdf/10.1145/3618260.3649775 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | proceedings-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Proceedings of the 56th Annual ACM Symposium on Theory of Computing |
| best_oa_location.landing_page_url | https://doi.org/10.1145/3618260.3649775 |
| primary_location.id | doi:10.1145/3618260.3649775 |
| primary_location.is_oa | True |
| primary_location.source | |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://dl.acm.org/doi/pdf/10.1145/3618260.3649775 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | proceedings-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Proceedings of the 56th Annual ACM Symposium on Theory of Computing |
| primary_location.landing_page_url | https://doi.org/10.1145/3618260.3649775 |
| publication_date | 2024-06-10 |
| publication_year | 2024 |
| referenced_works | https://openalex.org/W2021586362, https://openalex.org/W4376651380, https://openalex.org/W3192071094, https://openalex.org/W3004307906, https://openalex.org/W2032133054, https://openalex.org/W2006453614, https://openalex.org/W2799205037, https://openalex.org/W2920344594, https://openalex.org/W2809293764, https://openalex.org/W2968372074, https://openalex.org/W2625723895, https://openalex.org/W4385654407, https://openalex.org/W3157193347, https://openalex.org/W4214811950, https://openalex.org/W1522899817, https://openalex.org/W1872294524, https://openalex.org/W1686844196, https://openalex.org/W2255673366, https://openalex.org/W2109693837, https://openalex.org/W2142968417, https://openalex.org/W1502416796, https://openalex.org/W2148098270, https://openalex.org/W2062427087, https://openalex.org/W4206758876, https://openalex.org/W2040438296, https://openalex.org/W2148373594, https://openalex.org/W2139044314, https://openalex.org/W2038202352, https://openalex.org/W2954790660, https://openalex.org/W1522706628, https://openalex.org/W4300025581, https://openalex.org/W2091434162, https://openalex.org/W2794934772, https://openalex.org/W4285136272, https://openalex.org/W3115656545, https://openalex.org/W3151046115, https://openalex.org/W2067596507, https://openalex.org/W3037427224, https://openalex.org/W2732980408, https://openalex.org/W3115438312, https://openalex.org/W1979397185, https://openalex.org/W2082647621, https://openalex.org/W2293021588, https://openalex.org/W2033159094, https://openalex.org/W1856987595, https://openalex.org/W2176120077, https://openalex.org/W4313227396, https://openalex.org/W3196690149, https://openalex.org/W2982087871, https://openalex.org/W3115192023, https://openalex.org/W2293988196, https://openalex.org/W1882771262, https://openalex.org/W1555733702, https://openalex.org/W2399200320 |
| referenced_works_count | 54 |
| abstract_inverted_index.- | 106, 194, 284 |
| abstract_inverted_index.L | 112, 115, 332 |
| abstract_inverted_index.a | 7, 117, 129, 162, 319, 326, 330 |
| abstract_inverted_index.t | 27 |
| abstract_inverted_index.In | 29, 63, 175 |
| abstract_inverted_index.L, | 12, 17 |
| abstract_inverted_index.L. | 338 |
| abstract_inverted_index.NP | 15, 61, 179, 190, 216 |
| abstract_inverted_index.UP | 169 |
| abstract_inverted_index.We | 92, 263 |
| abstract_inverted_index.an | 224, 334 |
| abstract_inverted_index.as | 252 |
| abstract_inverted_index.be | 250, 308 |
| abstract_inverted_index.do | 191 |
| abstract_inverted_index.is | 21, 39, 45, 135, 155, 173 |
| abstract_inverted_index.of | 32, 59, 66, 84, 101, 189, 222, 269 |
| abstract_inverted_index.or | 89, 141, 202 |
| abstract_inverted_index.to | 273, 324 |
| abstract_inverted_index.NP, | 85, 205, 288 |
| abstract_inverted_index.NP. | 299 |
| abstract_inverted_index.SWI | 126, 140, 145, 154, 183, 335 |
| abstract_inverted_index.SZK | 243, 253 |
| abstract_inverted_index.The | 133 |
| abstract_inverted_index.UP, | 56 |
| abstract_inverted_index.all | 83, 188 |
| abstract_inverted_index.and | 72, 104, 128, 229, 282, 314 |
| abstract_inverted_index.are | 2, 53, 75, 79, 255 |
| abstract_inverted_index.but | 41 |
| abstract_inverted_index.can | 307 |
| abstract_inverted_index.for | 13, 55, 82, 111, 137, 142, 150, 164, 187, 204, 215, 287, 298, 329, 337 |
| abstract_inverted_index.has | 116 |
| abstract_inverted_index.how | 323 |
| abstract_inverted_index.new | 266, 320 |
| abstract_inverted_index.not | 181, 192 |
| abstract_inverted_index.now | 80 |
| abstract_inverted_index.our | 312 |
| abstract_inverted_index.the | 26, 30, 36, 42, 48, 57, 64, 94, 99, 219, 304 |
| abstract_inverted_index.∈ | 11 |
| abstract_inverted_index.Both | 311 |
| abstract_inverted_index.This | 160, 248 |
| abstract_inverted_index.also | 301 |
| abstract_inverted_index.both | 70 |
| abstract_inverted_index.case | 31, 65 |
| abstract_inverted_index.does | 180 |
| abstract_inverted_index.from | 146, 237, 245, 318 |
| abstract_inverted_index.have | 182 |
| abstract_inverted_index.into | 333 |
| abstract_inverted_index.made | 309 |
| abstract_inverted_index.much | 22 |
| abstract_inverted_index.only | 257 |
| abstract_inverted_index.same | 220 |
| abstract_inverted_index.some | 14 |
| abstract_inverted_index.stem | 317 |
| abstract_inverted_index.than | 24 |
| abstract_inverted_index.that | 5, 9, 20, 114, 178 |
| abstract_inverted_index.with | 18, 123, 207, 217, 290 |
| abstract_inverted_index.zero | 275, 305 |
| abstract_inverted_index.(SWI) | 121 |
| abstract_inverted_index.(SZK) | 213 |
| abstract_inverted_index.(with | 278 |
| abstract_inverted_index.BARGs | 236, 286 |
| abstract_inverted_index.Batch | 0 |
| abstract_inverted_index.Thus, | 233 |
| abstract_inverted_index.batch | 51, 102, 109, 166, 185, 197, 200, 271, 327 |
| abstract_inverted_index.class | 58 |
| abstract_inverted_index.first | 95 |
| abstract_inverted_index.given | 47 |
| abstract_inverted_index.group | 90 |
| abstract_inverted_index.imply | 113, 210, 293 |
| abstract_inverted_index.known | 54, 81, 258 |
| abstract_inverted_index.poses | 161 |
| abstract_inverted_index.proof | 3 |
| abstract_inverted_index.prove | 265 |
| abstract_inverted_index.sound | 108, 196 |
| abstract_inverted_index.would | 240, 249 |
| abstract_inverted_index.yield | 241 |
| abstract_inverted_index.(a.k.a | 199 |
| abstract_inverted_index.(where | 35, 69, 170 |
| abstract_inverted_index.BARGs) | 203 |
| abstract_inverted_index.beyond | 168 |
| abstract_inverted_index.error, | 127, 228 |
| abstract_inverted_index.exist. | 193 |
| abstract_inverted_index.honest | 43, 71, 131, 231 |
| abstract_inverted_index.number | 221 |
| abstract_inverted_index.proof, | 122 |
| abstract_inverted_index.proofs | 1, 52, 103, 110, 167, 186, 198 |
| abstract_inverted_index.prover | 38, 44, 281 |
| abstract_inverted_index.barrier | 163 |
| abstract_inverted_index.exhibit | 93 |
| abstract_inverted_index.further | 264 |
| abstract_inverted_index.inverse | 124, 225 |
| abstract_inverted_index.lattice | 88 |
| abstract_inverted_index.one-way | 158, 208, 238, 246, 291 |
| abstract_inverted_index.proofs, | 184 |
| abstract_inverted_index.prover. | 132, 232 |
| abstract_inverted_index.provers | 74 |
| abstract_inverted_index.results | 97, 316 |
| abstract_inverted_index.roughly | 218 |
| abstract_inverted_index.rounds, | 223 |
| abstract_inverted_index.sending | 25 |
| abstract_inverted_index.shorter | 23 |
| abstract_inverted_index.showing | 322 |
| abstract_inverted_index.systems | 4 |
| abstract_inverted_index.uniform | 280 |
| abstract_inverted_index.whereas | 149 |
| abstract_inverted_index.witness | 119, 171 |
| abstract_inverted_index.Assuming | 300 |
| abstract_inverted_index.assuming | 86, 157, 177, 259 |
| abstract_inverted_index.cheating | 37 |
| abstract_inverted_index.convince | 6 |
| abstract_inverted_index.explicit | 279 |
| abstract_inverted_index.language | 16, 331 |
| abstract_inverted_index.negative | 96, 313 |
| abstract_inverted_index.obtained | 156 |
| abstract_inverted_index.positive | 267, 315 |
| abstract_inverted_index.protocol | 328, 336 |
| abstract_inverted_index.standard | 87 |
| abstract_inverted_index.together | 206, 289 |
| abstract_inverted_index.verifier | 8 |
| abstract_inverted_index.achieving | 165 |
| abstract_inverted_index.arguments | 201, 214, 244, 254, 272, 277, 297 |
| abstract_inverted_index.currently | 256 |
| abstract_inverted_index.dishonest | 73 |
| abstract_inverted_index.dual-mode | 302 |
| abstract_inverted_index.efficient | 46 |
| abstract_inverted_index.existence | 100 |
| abstract_inverted_index.framework | 321 |
| abstract_inverted_index.functions | 239 |
| abstract_inverted_index.knowledge | 276, 306 |
| abstract_inverted_index.obtaining | 138, 143 |
| abstract_inverted_index.protocols | 152 |
| abstract_inverted_index.regarding | 98 |
| abstract_inverted_index.solutions | 78 |
| abstract_inverted_index.soundness | 34, 68 |
| abstract_inverted_index.transform | 325 |
| abstract_inverted_index.trivial). | 174 |
| abstract_inverted_index.unbounded | 40 |
| abstract_inverted_index.x1,…,xt | 10 |
| abstract_inverted_index.arguments: | 105 |
| abstract_inverted_index.functions, | 209, 292 |
| abstract_inverted_index.functions. | 159, 247 |
| abstract_inverted_index.languages. | 62 |
| abstract_inverted_index.polynomial | 125, 226 |
| abstract_inverted_index.protocols, | 148 |
| abstract_inverted_index.surprising | 251 |
| abstract_inverted_index.verifier): | 283 |
| abstract_inverted_index.witnesses. | 28 |
| abstract_inverted_index.efficient), | 76 |
| abstract_inverted_index.implication | 134 |
| abstract_inverted_index.interactive | 50, 235 |
| abstract_inverted_index.non-uniform | 130, 230 |
| abstract_inverted_index.particular, | 176 |
| abstract_inverted_index.public-coin | 147 |
| abstract_inverted_index.statistical | 33, 211 |
| abstract_inverted_index.witnesses), | 49 |
| abstract_inverted_index.assumptions. | 91 |
| abstract_inverted_index.commitments, | 303 |
| abstract_inverted_index.commitments. | 262 |
| abstract_inverted_index.full-fledged | 144, 153 |
| abstract_inverted_index.implications | 268 |
| abstract_inverted_index.private-coin | 151 |
| abstract_inverted_index.statistical. | 310 |
| abstract_inverted_index.Statistically | 107 |
| abstract_inverted_index.communication | 19 |
| abstract_inverted_index.computational | 67, 295 |
| abstract_inverted_index.statistically | 118 |
| abstract_inverted_index.unconditional | 136 |
| abstract_inverted_index.constant-round | 234, 242, 260 |
| abstract_inverted_index.unique-witness | 60 |
| abstract_inverted_index.zero-knowledge | 212, 227, 296 |
| abstract_inverted_index.Computationally | 195 |
| abstract_inverted_index.Non-interactive | 285 |
| abstract_inverted_index.honest-verifier | 139 |
| abstract_inverted_index.non-interactive | 77, 270, 274, 294 |
| abstract_inverted_index.indistinguishable | 120 |
| abstract_inverted_index.indistinguishability | 172 |
| abstract_inverted_index.statistically-hiding | 261 |
| cited_by_percentile_year.max | 98 |
| cited_by_percentile_year.min | 94 |
| countries_distinct_count | 3 |
| institutions_distinct_count | 5 |
| citation_normalized_percentile.value | 0.92852091 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |