{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BTWKUBXJFV7BM4AI5QNYO2OZWE","short_pith_number":"pith:BTWKUBXJ","canonical_record":{"source":{"id":"1806.03078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-08T10:56:11Z","cross_cats_sorted":[],"title_canon_sha256":"e638a3b9d149ec2910d16c28796fc48366d65ea4a93d87753368b192eea02c51","abstract_canon_sha256":"8cf1648b21c6ac48102141953f981454486a0ea87dcd25bcb9734aa07b22455c"},"schema_version":"1.0"},"canonical_sha256":"0cecaa06e92d7e167008ec1b8769d9b13dd922afe18c3d37022b3f06af8b4391","source":{"kind":"arxiv","id":"1806.03078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03078","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03078v1","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03078","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"pith_short_12","alias_value":"BTWKUBXJFV7B","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BTWKUBXJFV7BM4AI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BTWKUBXJ","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BTWKUBXJFV7BM4AI5QNYO2OZWE","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-08T10:56:11Z","cross_cats_sorted":[],"title_canon_sha256":"e638a3b9d149ec2910d16c28796fc48366d65ea4a93d87753368b192eea02c51","abstract_canon_sha256":"8cf1648b21c6ac48102141953f981454486a0ea87dcd25bcb9734aa07b22455c"},"schema_version":"1.0"},"canonical_sha256":"0cecaa06e92d7e167008ec1b8769d9b13dd922afe18c3d37022b3f06af8b4391","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:49.749061Z","signature_b64":"1Dp7/5ftP6xOdLuIBw7NcY4yiWtZWKK7+oGvZsSftavlvjl7oUX3f4ZN6txLnwh9JXt/0TpjhgQsXY4gwrP7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cecaa06e92d7e167008ec1b8769d9b13dd922afe18c3d37022b3f06af8b4391","last_reissued_at":"2026-05-18T00:13:49.748412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:49.748412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03078","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:13:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KsoYuGBMSKEyWmU3gyryC8LQRmu7pALFMoG0AKGI7eXifPu4Qr1P9Xg+rkAsry1a9SrjDF2xAbAVfMatyORCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:43:20.467814Z"},"content_sha256":"84c5afaf603bdb0cc98a6a1306aeacdf311de2ef65d6783997d7be113d412ae3","schema_version":"1.0","event_id":"sha256:84c5afaf603bdb0cc98a6a1306aeacdf311de2ef65d6783997d7be113d412ae3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BTWKUBXJFV7BM4AI5QNYO2OZWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Twin Conjugacy Search Problem and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Weiqing You, Wenxi Li, Xiaoming Chen","submitted_at":"2018-06-08T10:56:11Z","abstract_excerpt":"We propose a new computational problem over the noncommutative group, called the twin conjugacy search problem. This problem is related to the conjugacy search problem and can be used for almost all of the same cryptographic constructions that are based on the conjugacy search problem. However, our new problem is at least hard as the conjugacy search problem. Moreover, the twin conjugacy search problem have many applications. One of the most important applications, we propose a trapdoor test which can replace the function of the decision oracle. We also show other applications of the problem, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03078","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:13:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+71JnEHo4LD6Q757UU4LRfbn/sBY392ngbJXwbElluvGrDl+QU3mCf+hPvk4FTOUs1ao05yhzzRA5Vbz+Rc/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:43:20.468159Z"},"content_sha256":"873026746a27abde1add1d34991faab8728795e345380e310159e9c40a66e423","schema_version":"1.0","event_id":"sha256:873026746a27abde1add1d34991faab8728795e345380e310159e9c40a66e423"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTWKUBXJFV7BM4AI5QNYO2OZWE/bundle.json","state_url":"https://pith.science/pith/BTWKUBXJFV7BM4AI5QNYO2OZWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTWKUBXJFV7BM4AI5QNYO2OZWE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T04:43:20Z","links":{"resolver":"https://pith.science/pith/BTWKUBXJFV7BM4AI5QNYO2OZWE","bundle":"https://pith.science/pith/BTWKUBXJFV7BM4AI5QNYO2OZWE/bundle.json","state":"https://pith.science/pith/BTWKUBXJFV7BM4AI5QNYO2OZWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTWKUBXJFV7BM4AI5QNYO2OZWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BTWKUBXJFV7BM4AI5QNYO2OZWE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8cf1648b21c6ac48102141953f981454486a0ea87dcd25bcb9734aa07b22455c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-08T10:56:11Z","title_canon_sha256":"e638a3b9d149ec2910d16c28796fc48366d65ea4a93d87753368b192eea02c51"},"schema_version":"1.0","source":{"id":"1806.03078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03078","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03078v1","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03078","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"pith_short_12","alias_value":"BTWKUBXJFV7B","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BTWKUBXJFV7BM4AI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BTWKUBXJ","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:873026746a27abde1add1d34991faab8728795e345380e310159e9c40a66e423","target":"graph","created_at":"2026-05-18T00:13:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose a new computational problem over the noncommutative group, called the twin conjugacy search problem. This problem is related to the conjugacy search problem and can be used for almost all of the same cryptographic constructions that are based on the conjugacy search problem. However, our new problem is at least hard as the conjugacy search problem. Moreover, the twin conjugacy search problem have many applications. One of the most important applications, we propose a trapdoor test which can replace the function of the decision oracle. We also show other applications of the problem, ","authors_text":"Weiqing You, Wenxi Li, Xiaoming Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-08T10:56:11Z","title":"The Twin Conjugacy Search Problem and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03078","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:84c5afaf603bdb0cc98a6a1306aeacdf311de2ef65d6783997d7be113d412ae3","target":"record","created_at":"2026-05-18T00:13:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8cf1648b21c6ac48102141953f981454486a0ea87dcd25bcb9734aa07b22455c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-08T10:56:11Z","title_canon_sha256":"e638a3b9d149ec2910d16c28796fc48366d65ea4a93d87753368b192eea02c51"},"schema_version":"1.0","source":{"id":"1806.03078","kind":"arxiv","version":1}},"canonical_sha256":"0cecaa06e92d7e167008ec1b8769d9b13dd922afe18c3d37022b3f06af8b4391","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cecaa06e92d7e167008ec1b8769d9b13dd922afe18c3d37022b3f06af8b4391","first_computed_at":"2026-05-18T00:13:49.748412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:49.748412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Dp7/5ftP6xOdLuIBw7NcY4yiWtZWKK7+oGvZsSftavlvjl7oUX3f4ZN6txLnwh9JXt/0TpjhgQsXY4gwrP7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:49.749061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84c5afaf603bdb0cc98a6a1306aeacdf311de2ef65d6783997d7be113d412ae3","sha256:873026746a27abde1add1d34991faab8728795e345380e310159e9c40a66e423"],"state_sha256":"e22429aa9ac96001fcf08ec9e64c6b3640017208c6284d6dd8a81804eb09f3ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JM/vZffFRcoupT2n4aqtZ8rjVqDGUtmTVo4bA7NtBd/rWsGGC70/p1xGpmhsQNqKGJ1WMnJQXCsQypyIgUxzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:43:20.470151Z","bundle_sha256":"8c31fd115e4f654b37d2f06367e7120dbf6129dea0ba8668f9c6a42c44b83197"}}