{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:V7GK2P7FTKOLOFGL4IR226MDAH","short_pith_number":"pith:V7GK2P7F","schema_version":"1.0","canonical_sha256":"afccad3fe59a9cb714cbe223ad798301ecada5447ea452dc00d3ada0762cf5b9","source":{"kind":"arxiv","id":"2603.18608","version":2},"attestation_state":"computed","paper":{"title":"A Complexity Hierarchy of Shuffles in Card-Based Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Shuffles in card-based cryptography form a complexity hierarchy with provable separations between levels.","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Suthee Ruangwises, Tomoki Ono","submitted_at":"2026-03-19T08:27:02Z","abstract_excerpt":"Card-based cryptography uses physical playing cards to construct protocols for secure multi-party computation. Existing card-based protocols employ various types of shuffles, some of which are easy to implement in practice while others are considerably more complex. In this paper, we classify shuffle operations into several levels according to their implementation complexity. We motivate this hierarchy from both practical and theoretical perspectives, and prove separation results between several levels by showing that certain shuffles cannot be realized using only operations from lower levels."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2603.18608","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-03-19T08:27:02Z","cross_cats_sorted":[],"title_canon_sha256":"3aa58a47fcc13348406abefece7b43d4c8b1bc41100c608c10ae5becbbd222d7","abstract_canon_sha256":"9ce38b535bc38cd8402e30b1fd4281dd29a452ded616a45ed44c677ab80e3e64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:59.623080Z","signature_b64":"bUHJaxluIW8yMaBnOCbRlAB62CRwInE12H/Wv3k2MRiU/7oSql1Yz1QDb93BNq0eku+larBFekoUuIfPonWNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afccad3fe59a9cb714cbe223ad798301ecada5447ea452dc00d3ada0762cf5b9","last_reissued_at":"2026-05-17T23:38:59.622334Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:59.622334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Complexity Hierarchy of Shuffles in Card-Based Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Shuffles in card-based cryptography form a complexity hierarchy with provable separations between levels.","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Suthee Ruangwises, Tomoki Ono","submitted_at":"2026-03-19T08:27:02Z","abstract_excerpt":"Card-based cryptography uses physical playing cards to construct protocols for secure multi-party computation. Existing card-based protocols employ various types of shuffles, some of which are easy to implement in practice while others are considerably more complex. In this paper, we classify shuffle operations into several levels according to their implementation complexity. We motivate this hierarchy from both practical and theoretical perspectives, and prove separation results between several levels by showing that certain shuffles cannot be realized using only operations from lower levels."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we classify shuffle operations into several levels according to their implementation complexity [...] prove separation results between several levels by showing that certain shuffles cannot be realized using only operations from lower levels. Finally, we propose a new complexity measure for evaluating card-based protocols based on this hierarchy.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That practical implementation complexity of shuffles can be meaningfully ordered into strict levels with provable separations that hold across all possible physical realizations and human execution variations.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A new hierarchy classifies card shuffles by complexity with separation proofs, enabling a measure for protocol evaluation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Shuffles in card-based cryptography form a complexity hierarchy with provable separations between levels.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7268760e773e7e80b1073b20926f6141f7c0838e8085fd438cb56f42cd6a5f7d"},"source":{"id":"2603.18608","kind":"arxiv","version":2},"verdict":{"id":"a6145b3e-b959-41d4-ade9-1a973a7970cb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T08:58:56.242936Z","strongest_claim":"we classify shuffle operations into several levels according to their implementation complexity [...] prove separation results between several levels by showing that certain shuffles cannot be realized using only operations from lower levels. Finally, we propose a new complexity measure for evaluating card-based protocols based on this hierarchy.","one_line_summary":"A new hierarchy classifies card shuffles by complexity with separation proofs, enabling a measure for protocol evaluation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That practical implementation complexity of shuffles can be meaningfully ordered into strict levels with provable separations that hold across all possible physical realizations and human execution variations.","pith_extraction_headline":"Shuffles in card-based cryptography form a complexity hierarchy with provable separations between levels."},"references":{"count":23,"sample":[{"doi":"","year":2021,"title":"Y. Abe, Y. Hayashi, T. Mizuki and H. Sone. Five-Card AND Computations in Com- mitted Format Using Only Uniform Cyclic Shuffles.New Generation Computing, 39(1): 97–114 (2021)","work_id":"32324761-8c55-41b0-88e8-6d251a18850d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"X. Bultel, J. Dreier, J.-G. Dumas, P. Lafourcade, D. Miyahara, T. Mizuki, A. Nagao, T. Sasaki, K. Shinagawa and H. Sone. Physical Zero-Knowledge Proof for Makaro. In Proceedings of the 20th Internatio","work_id":"09397f15-30ff-44f5-9a8e-42cc0441f581","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1990,"title":"B. den Boer. More Efficient Match-Making and Satisfiability: the Five Card Trick. In Proceedings of the Workshop on the Theory and Application of of Cryptographic Tech- niques (EUROCRYPT ’89), pp. 208","work_id":"d0dbd4a4-c2fd-4ca0-bc3e-18252f5a3ca1","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"R. Gradwohl, M. Naor, B. Pinkas and G.N. Rothblum. Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.Theory of Computing Systems, 44(2): 245–268 (2009)","work_id":"491a39bc-46d9-48b3-a5ea-75ec71b1f196","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"R. Ishikawa, E. Chida and T. Mizuki. Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points. InProceedings of the 14th Interna- tional Conference on Unconventio","work_id":"29450314-f5b2-4e27-8c0b-ceb23c0b2652","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":23,"snapshot_sha256":"bc15340742c23b15190821d1aa3f302e2f87fa965a23fe91717cc765ea660e41","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"edd2c530b9e6fdd3837aaed620a4f1ebfc6a841b824f500b6804315732a2cb48"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.18608","created_at":"2026-05-17T23:38:59.622448+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.18608v2","created_at":"2026-05-17T23:38:59.622448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.18608","created_at":"2026-05-17T23:38:59.622448+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7GK2P7FTKOL","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7GK2P7FTKOLOFGL","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7GK2P7F","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V7GK2P7FTKOLOFGL4IR226MDAH","json":"https://pith.science/pith/V7GK2P7FTKOLOFGL4IR226MDAH.json","graph_json":"https://pith.science/api/pith-number/V7GK2P7FTKOLOFGL4IR226MDAH/graph.json","events_json":"https://pith.science/api/pith-number/V7GK2P7FTKOLOFGL4IR226MDAH/events.json","paper":"https://pith.science/paper/V7GK2P7F"},"agent_actions":{"view_html":"https://pith.science/pith/V7GK2P7FTKOLOFGL4IR226MDAH","download_json":"https://pith.science/pith/V7GK2P7FTKOLOFGL4IR226MDAH.json","view_paper":"https://pith.science/paper/V7GK2P7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.18608&json=true","fetch_graph":"https://pith.science/api/pith-number/V7GK2P7FTKOLOFGL4IR226MDAH/graph.json","fetch_events":"https://pith.science/api/pith-number/V7GK2P7FTKOLOFGL4IR226MDAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7GK2P7FTKOLOFGL4IR226MDAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7GK2P7FTKOLOFGL4IR226MDAH/action/storage_attestation","attest_author":"https://pith.science/pith/V7GK2P7FTKOLOFGL4IR226MDAH/action/author_attestation","sign_citation":"https://pith.science/pith/V7GK2P7FTKOLOFGL4IR226MDAH/action/citation_signature","submit_replication":"https://pith.science/pith/V7GK2P7FTKOLOFGL4IR226MDAH/action/replication_record"}},"created_at":"2026-05-17T23:38:59.622448+00:00","updated_at":"2026-05-17T23:38:59.622448+00:00"}