{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CADWOAHNG67F7R5J2WDGHNOQXV","short_pith_number":"pith:CADWOAHN","schema_version":"1.0","canonical_sha256":"10076700ed37be5fc7a9d58663b5d0bd50b094a416daed051de72faa517f9632","source":{"kind":"arxiv","id":"1809.01320","version":1},"attestation_state":"computed","paper":{"title":"Multi-Client Order-Revealing Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Dong Hoon Lee, Jieun Eom, Kwangsu Lee","submitted_at":"2018-09-05T04:51:10Z","abstract_excerpt":"Order-revealing encryption is a useful cryptographic primitive that provides range queries on encrypted data since anyone can compare the order of plaintexts by running a public comparison algorithm. Most studies on order-revealing encryption focus only on comparing ciphertexts generated by a single client, and there is no study on comparing ciphertexts generated by multiple clients. In this paper, we propose the concept of multi-client order-revealing encryption that supports comparisons not only on ciphertexts generated by one client but also on ciphertexts generated by multiple clients. We "},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1809.01320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-05T04:51:10Z","cross_cats_sorted":[],"title_canon_sha256":"159803015eef4cfc72e5e074aaa50299aa8d536144e6ca71bf909aae7c4d7cce","abstract_canon_sha256":"afaba8ddac505cedf0af23ff98488910b0de1af1ca7678b4122f631faf9819ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:28.023245Z","signature_b64":"ED+PzuY0q/OZFawMBcTAXiuGuXwnmO+MpjHl0onNtdgLDVwzIWyjdE7apTmJy7l6MKLI23PRJhC2BRMCkcyKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10076700ed37be5fc7a9d58663b5d0bd50b094a416daed051de72faa517f9632","last_reissued_at":"2026-05-18T00:06:28.022599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:28.022599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Client Order-Revealing Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Dong Hoon Lee, Jieun Eom, Kwangsu Lee","submitted_at":"2018-09-05T04:51:10Z","abstract_excerpt":"Order-revealing encryption is a useful cryptographic primitive that provides range queries on encrypted data since anyone can compare the order of plaintexts by running a public comparison algorithm. Most studies on order-revealing encryption focus only on comparing ciphertexts generated by a single client, and there is no study on comparing ciphertexts generated by multiple clients. In this paper, we propose the concept of multi-client order-revealing encryption that supports comparisons not only on ciphertexts generated by one client but also on ciphertexts generated by multiple clients. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01320","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"1809.01320","created_at":"2026-05-18T00:06:28.022706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.01320v1","created_at":"2026-05-18T00:06:28.022706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01320","created_at":"2026-05-18T00:06:28.022706+00:00"},{"alias_kind":"pith_short_12","alias_value":"CADWOAHNG67F","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CADWOAHNG67F7R5J","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CADWOAHN","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CADWOAHNG67F7R5J2WDGHNOQXV","json":"https://pith.science/pith/CADWOAHNG67F7R5J2WDGHNOQXV.json","graph_json":"https://pith.science/api/pith-number/CADWOAHNG67F7R5J2WDGHNOQXV/graph.json","events_json":"https://pith.science/api/pith-number/CADWOAHNG67F7R5J2WDGHNOQXV/events.json","paper":"https://pith.science/paper/CADWOAHN"},"agent_actions":{"view_html":"https://pith.science/pith/CADWOAHNG67F7R5J2WDGHNOQXV","download_json":"https://pith.science/pith/CADWOAHNG67F7R5J2WDGHNOQXV.json","view_paper":"https://pith.science/paper/CADWOAHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.01320&json=true","fetch_graph":"https://pith.science/api/pith-number/CADWOAHNG67F7R5J2WDGHNOQXV/graph.json","fetch_events":"https://pith.science/api/pith-number/CADWOAHNG67F7R5J2WDGHNOQXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CADWOAHNG67F7R5J2WDGHNOQXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CADWOAHNG67F7R5J2WDGHNOQXV/action/storage_attestation","attest_author":"https://pith.science/pith/CADWOAHNG67F7R5J2WDGHNOQXV/action/author_attestation","sign_citation":"https://pith.science/pith/CADWOAHNG67F7R5J2WDGHNOQXV/action/citation_signature","submit_replication":"https://pith.science/pith/CADWOAHNG67F7R5J2WDGHNOQXV/action/replication_record"}},"created_at":"2026-05-18T00:06:28.022706+00:00","updated_at":"2026-05-18T00:06:28.022706+00:00"}