{"users":[{"id":-1,"username":"system","name":"system","avatar_template":"/uploads/default/original/1X/901232eb0384c7f52dbf24cce8be68528f0d9558.png","primary_group_name":"Authors","admin":true,"moderator":true,"trust_level":4}],"primary_groups":[{"id":41,"name":"Authors"}],"flair_groups":[],"topic_list":{"can_create_topic":false,"more_topics_url":"/c/resource/cryptographic-protocols/10?page=1","per_page":30,"top_tags":["2000-008","2000-014","2000-015","2000-019"],"topics":[{"id":25468,"title":"[Resource Topic] 2025/2137: Linear Secret-shared Shuffle with Malicious Security","fancy_title":"[Resource Topic] 2025/2137: Linear Secret-shared Shuffle with Malicious Security","slug":"resource-topic-2025-2137-linear-secret-shared-shuffle-with-malicious-security","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-22T23:49:19.277Z","last_posted_at":"2025-11-22T23:49:19.430Z","bumped":true,"bumped_at":"2025-11-22T23:49:19.430Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2137"],"tags_descriptions":{"2025-2137":"Linear Secret-shared Shuffle with Malicious Security"},"views":42,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25467,"title":"[Resource Topic] 2025/2136: The Latency Cost Of Censorship Resistance","fancy_title":"[Resource Topic] 2025/2136: The Latency Cost Of Censorship Resistance","slug":"resource-topic-2025-2136-the-latency-cost-of-censorship-resistance","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-22T23:49:18.388Z","last_posted_at":"2025-11-22T23:49:18.538Z","bumped":true,"bumped_at":"2025-11-22T23:49:18.538Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2136"],"tags_descriptions":{"2025-2136":"The Latency Cost Of Censorship Resistance"},"views":22,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25466,"title":"[Resource Topic] 2025/2135: Robust Elections and More: Fast MPC in the Preprocessing Model","fancy_title":"[Resource Topic] 2025/2135: Robust Elections and More: Fast MPC in the Preprocessing Model","slug":"resource-topic-2025-2135-robust-elections-and-more-fast-mpc-in-the-preprocessing-model","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-22T23:49:17.489Z","last_posted_at":"2025-11-22T23:49:17.640Z","bumped":true,"bumped_at":"2025-11-22T23:49:17.640Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2135"],"tags_descriptions":{"2025-2135":"Robust Elections and More: Fast MPC in the Preprocessing Model"},"views":19,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25464,"title":"[Resource Topic] 2025/2133: Byzantine Broadcast with Unknown Participants","fancy_title":"[Resource Topic] 2025/2133: Byzantine Broadcast with Unknown Participants","slug":"resource-topic-2025-2133-byzantine-broadcast-with-unknown-participants","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-22T23:44:13.179Z","last_posted_at":"2025-11-22T23:44:13.291Z","bumped":true,"bumped_at":"2025-11-22T23:44:13.291Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2133"],"tags_descriptions":{"2025-2133":"Byzantine Broadcast with Unknown Participants"},"views":8,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25463,"title":"[Resource Topic] 2025/2132: Bandwidth Efficient Partial Authorized PSI","fancy_title":"[Resource Topic] 2025/2132: Bandwidth Efficient Partial Authorized PSI","slug":"resource-topic-2025-2132-bandwidth-efficient-partial-authorized-psi","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-22T23:44:12.213Z","last_posted_at":"2025-11-22T23:44:12.352Z","bumped":true,"bumped_at":"2025-11-22T23:44:12.352Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2132"],"tags_descriptions":{"2025-2132":"Bandwidth Efficient Partial Authorized PSI"},"views":11,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25458,"title":"[Resource Topic] 2025/2127: Censorship-Resistant Sealed-Bid Auctions on Blockchains","fancy_title":"[Resource Topic] 2025/2127: Censorship-Resistant Sealed-Bid Auctions on Blockchains","slug":"resource-topic-2025-2127-censorship-resistant-sealed-bid-auctions-on-blockchains","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-21T14:26:52.236Z","last_posted_at":"2025-11-21T14:26:52.381Z","bumped":true,"bumped_at":"2025-11-21T14:26:52.381Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2127"],"tags_descriptions":{"2025-2127":"Censorship-Resistant Sealed-Bid Auctions on Blockchains"},"views":13,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25456,"title":"[Resource Topic] 2025/2125: Are ideal functionalities really ideal?","fancy_title":"[Resource Topic] 2025/2125: Are ideal functionalities really ideal?","slug":"resource-topic-2025-2125-are-ideal-functionalities-really-ideal","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-21T14:26:50.463Z","last_posted_at":"2025-11-21T14:26:50.627Z","bumped":true,"bumped_at":"2025-11-21T14:26:50.627Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2125"],"tags_descriptions":{"2025-2125":"Are ideal functionalities really ideal?"},"views":19,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25455,"title":"[Resource Topic] 2025/2124: SALSAA – Sumcheck-Aided Lattice-based Succinct Arguments and Applications","fancy_title":"[Resource Topic] 2025/2124: SALSAA – Sumcheck-Aided Lattice-based Succinct Arguments and Applications","slug":"resource-topic-2025-2124-salsaa-sumcheck-aided-lattice-based-succinct-arguments-and-applications","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-21T14:26:49.603Z","last_posted_at":"2025-11-21T14:26:49.758Z","bumped":true,"bumped_at":"2025-11-21T14:26:49.758Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2124"],"tags_descriptions":{"2025-2124":"SALSAA – Sumcheck-Aided Lattice-based Succinct Arguments and Applications"},"views":15,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25449,"title":"[Resource Topic] 2025/2118: Revisiting Rational Broadcast Protocols","fancy_title":"[Resource Topic] 2025/2118: Revisiting Rational Broadcast Protocols","slug":"resource-topic-2025-2118-revisiting-rational-broadcast-protocols","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-21T14:16:38.903Z","last_posted_at":"2025-11-21T14:16:39.043Z","bumped":true,"bumped_at":"2025-11-21T14:16:39.043Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2118"],"tags_descriptions":{"2025-2118":"Revisiting Rational Broadcast Protocols"},"views":26,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25447,"title":"[Resource Topic] 2025/2116: Oblivious Batch Updates for Bloom-Filter-based Outsourced Cryptographic Protocols","fancy_title":"[Resource Topic] 2025/2116: Oblivious Batch Updates for Bloom-Filter-based Outsourced Cryptographic Protocols","slug":"resource-topic-2025-2116-oblivious-batch-updates-for-bloom-filter-based-outsourced-cryptographic-protocols","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-19T06:51:04.269Z","last_posted_at":"2025-11-19T06:51:04.430Z","bumped":true,"bumped_at":"2025-11-19T06:51:04.430Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2116"],"tags_descriptions":{"2025-2116":"Oblivious Batch Updates for Bloom-Filter-based Outsourced Cryptographic Proto..."},"views":15,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25446,"title":"[Resource Topic] 2025/2115: Weighted Batched Threshold Encryption with Applications to Mempool Privacy","fancy_title":"[Resource Topic] 2025/2115: Weighted Batched Threshold Encryption with Applications to Mempool Privacy","slug":"resource-topic-2025-2115-weighted-batched-threshold-encryption-with-applications-to-mempool-privacy","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-19T06:51:03.478Z","last_posted_at":"2025-11-19T06:51:03.625Z","bumped":true,"bumped_at":"2025-11-19T06:51:03.625Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2115"],"tags_descriptions":{"2025-2115":"Weighted Batched Threshold Encryption with Applications to Mempool Privacy"},"views":18,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25444,"title":"[Resource Topic] 2025/2113: Single-Server Private Outsourcing of zk-SNARKs","fancy_title":"[Resource Topic] 2025/2113: Single-Server Private Outsourcing of zk-SNARKs","slug":"resource-topic-2025-2113-single-server-private-outsourcing-of-zk-snarks","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-19T06:45:59.046Z","last_posted_at":"2025-11-19T06:45:59.156Z","bumped":true,"bumped_at":"2025-11-19T06:45:59.156Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2113"],"tags_descriptions":{"2025-2113":"Single-Server Private Outsourcing of zk-SNARKs"},"views":14,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25442,"title":"[Resource Topic] 2025/2111: SoK: Secure Computation over Secret Shares","fancy_title":"[Resource Topic] 2025/2111: SoK: Secure Computation over Secret Shares","slug":"resource-topic-2025-2111-sok-secure-computation-over-secret-shares","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-19T06:40:54.719Z","last_posted_at":"2025-11-19T06:40:54.850Z","bumped":true,"bumped_at":"2025-11-19T06:40:54.850Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2111"],"tags_descriptions":{"2025-2111":"SoK: Secure Computation over Secret Shares"},"views":11,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25440,"title":"[Resource Topic] 2025/2109: Secure Lookup Tables: Faster, Leaner, and More General","fancy_title":"[Resource Topic] 2025/2109: Secure Lookup Tables: Faster, Leaner, and More General","slug":"resource-topic-2025-2109-secure-lookup-tables-faster-leaner-and-more-general","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-18T10:22:36.159Z","last_posted_at":"2025-11-18T10:22:36.317Z","bumped":true,"bumped_at":"2025-11-18T10:22:36.317Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2109"],"tags_descriptions":{"2025-2109":"Secure Lookup Tables: Faster, Leaner, and More General"},"views":9,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25435,"title":"[Resource Topic] 2025/2104: Quantum Voting Protocol from Classical Assumption","fancy_title":"[Resource Topic] 2025/2104: Quantum Voting Protocol from Classical Assumption","slug":"resource-topic-2025-2104-quantum-voting-protocol-from-classical-assumption","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-17T02:09:49.863Z","last_posted_at":"2025-11-17T02:09:50.011Z","bumped":true,"bumped_at":"2025-11-17T02:09:50.011Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2104"],"tags_descriptions":{"2025-2104":"Quantum Voting Protocol from Classical Assumption"},"views":15,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25430,"title":"[Resource Topic] 2025/2099: A Lattice-based Designated Verifier zkSNARK from Standard Assumptions","fancy_title":"[Resource Topic] 2025/2099: A Lattice-based Designated Verifier zkSNARK from Standard Assumptions","slug":"resource-topic-2025-2099-a-lattice-based-designated-verifier-zksnark-from-standard-assumptions","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-17T01:49:37.162Z","last_posted_at":"2025-11-17T01:49:37.325Z","bumped":true,"bumped_at":"2025-11-17T01:49:37.325Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2099"],"tags_descriptions":{"2025-2099":"A Lattice-based Designated Verifier zkSNARK  from Standard Assumptions"},"views":8,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25428,"title":"[Resource Topic] 2025/2097: Hash-Based Blind Signatures: First Steps","fancy_title":"[Resource Topic] 2025/2097: Hash-Based Blind Signatures: First Steps","slug":"resource-topic-2025-2097-hash-based-blind-signatures-first-steps","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-17T01:49:35.409Z","last_posted_at":"2025-11-17T01:49:35.543Z","bumped":true,"bumped_at":"2025-11-17T01:49:35.543Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2097"],"tags_descriptions":{"2025-2097":"Hash-Based Blind Signatures: First Steps"},"views":12,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25426,"title":"[Resource Topic] 2025/2095: FPS: Flexible Payment System","fancy_title":"[Resource Topic] 2025/2095: FPS: Flexible Payment System","slug":"resource-topic-2025-2095-fps-flexible-payment-system","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-17T01:39:29.487Z","last_posted_at":"2025-11-17T01:39:29.668Z","bumped":true,"bumped_at":"2025-11-17T01:39:29.668Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2095"],"tags_descriptions":{"2025-2095":"FPS: Flexible Payment System"},"views":2,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25422,"title":"[Resource Topic] 2025/2091: Efficient and Proof-of-Useful-Work Friendly Local-Search for Distributed Consensus","fancy_title":"[Resource Topic] 2025/2091: Efficient and Proof-of-Useful-Work Friendly Local-Search for Distributed Consensus","slug":"resource-topic-2025-2091-efficient-and-proof-of-useful-work-friendly-local-search-for-distributed-consensus","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-14T07:13:11.423Z","last_posted_at":"2025-11-14T07:13:11.510Z","bumped":true,"bumped_at":"2025-11-14T07:13:11.510Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2091"],"tags_descriptions":{"2025-2091":"Efficient and Proof-of-Useful-Work Friendly Local-Search for Distributed Cons..."},"views":6,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25420,"title":"[Resource Topic] 2025/2089: Traceable Bottom-Up Secret Sharing and Law & Order on Community Social Key Recovery (Full Version)","fancy_title":"[Resource Topic] 2025/2089: Traceable Bottom-Up Secret Sharing and Law & Order on Community Social Key Recovery (Full Version)","slug":"resource-topic-2025-2089-traceable-bottom-up-secret-sharing-and-law-order-on-community-social-key-recovery-full-version","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T14:57:15.264Z","last_posted_at":"2025-11-13T14:57:15.419Z","bumped":true,"bumped_at":"2025-11-13T14:57:15.419Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2089"],"tags_descriptions":{"2025-2089":"Traceable Bottom-Up Secret Sharing and Law & Order on Community Social Key Re..."},"views":4,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25418,"title":"[Resource Topic] 2025/2087: Leakage-Free Enhanced Private Set Union for Balanced and Unbalanced Scenarios","fancy_title":"[Resource Topic] 2025/2087: Leakage-Free Enhanced Private Set Union for Balanced and Unbalanced Scenarios","slug":"resource-topic-2025-2087-leakage-free-enhanced-private-set-union-for-balanced-and-unbalanced-scenarios","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T14:57:13.568Z","last_posted_at":"2025-11-13T14:57:13.725Z","bumped":true,"bumped_at":"2025-11-13T14:57:13.725Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2087"],"tags_descriptions":{"2025-2087":"Leakage-Free Enhanced Private Set Union for Balanced and Unbalanced Scenarios"},"views":8,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25417,"title":"[Resource Topic] 2025/2086: On Composing AGM-Secure Functionalities with Cryptographic Proofs: Applications to Unbounded-Depth IVC and More","fancy_title":"[Resource Topic] 2025/2086: On Composing AGM-Secure Functionalities with Cryptographic Proofs: Applications to Unbounded-Depth IVC and More","slug":"resource-topic-2025-2086-on-composing-agm-secure-functionalities-with-cryptographic-proofs-applications-to-unbounded-depth-ivc-and-more","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T00:23:35.230Z","last_posted_at":"2025-11-13T00:23:35.359Z","bumped":true,"bumped_at":"2025-11-13T00:23:35.359Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2086"],"tags_descriptions":{"2025-2086":"On Composing AGM-Secure Functionalities with Cryptographic Proofs: Applicatio..."},"views":2,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25412,"title":"[Resource Topic] 2025/2081: Partial Fraction Techniques for Cryptography","fancy_title":"[Resource Topic] 2025/2081: Partial Fraction Techniques for Cryptography","slug":"resource-topic-2025-2081-partial-fraction-techniques-for-cryptography","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T00:18:28.543Z","last_posted_at":"2025-11-13T00:18:28.683Z","bumped":true,"bumped_at":"2025-11-13T00:18:28.683Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2081"],"tags_descriptions":{"2025-2081":"Partial Fraction Techniques for Cryptography"},"views":4,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25411,"title":"[Resource Topic] 2025/2080: Issuer Hiding for BBS-Based Anonymous Credentials","fancy_title":"[Resource Topic] 2025/2080: Issuer Hiding for BBS-Based Anonymous Credentials","slug":"resource-topic-2025-2080-issuer-hiding-for-bbs-based-anonymous-credentials","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T00:18:27.669Z","last_posted_at":"2025-11-13T00:18:27.813Z","bumped":true,"bumped_at":"2025-11-13T00:18:27.813Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2080"],"tags_descriptions":{"2025-2080":"Issuer Hiding for BBS-Based Anonymous Credentials"},"views":5,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25409,"title":"[Resource Topic] 2025/2078: Broadcast for Dynamic Committees without Trusted Setup","fancy_title":"[Resource Topic] 2025/2078: Broadcast for Dynamic Committees without Trusted Setup","slug":"resource-topic-2025-2078-broadcast-for-dynamic-committees-without-trusted-setup","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T00:13:23.341Z","last_posted_at":"2025-11-13T00:13:23.503Z","bumped":true,"bumped_at":"2025-11-13T00:13:23.503Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2078"],"tags_descriptions":{"2025-2078":"Broadcast for Dynamic Committees without Trusted Setup"},"views":2,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25408,"title":"[Resource Topic] 2025/2077: Malicious Homomorphic Secret Sharing with Applications to DV-NIZK and More","fancy_title":"[Resource Topic] 2025/2077: Malicious Homomorphic Secret Sharing with Applications to DV-NIZK and More","slug":"resource-topic-2025-2077-malicious-homomorphic-secret-sharing-with-applications-to-dv-nizk-and-more","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T00:13:22.427Z","last_posted_at":"2025-11-13T00:13:22.582Z","bumped":true,"bumped_at":"2025-11-13T00:13:22.582Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2077"],"tags_descriptions":{"2025-2077":"Malicious Homomorphic Secret Sharing with Applications to DV-NIZK and More"},"views":11,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25405,"title":"[Resource Topic] 2025/2074: VIA: Communication-Efficient Single-Server Private Information Retrieval","fancy_title":"[Resource Topic] 2025/2074: VIA: Communication-Efficient Single-Server Private Information Retrieval","slug":"resource-topic-2025-2074-via-communication-efficient-single-server-private-information-retrieval","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T00:13:19.913Z","last_posted_at":"2025-11-13T00:13:20.036Z","bumped":true,"bumped_at":"2025-11-13T00:13:20.036Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2074"],"tags_descriptions":{"2025-2074":"VIA: Communication-Efficient Single-Server Private Information Retrieval"},"views":5,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25403,"title":"[Resource Topic] 2025/2072: Multi-server Fuzzy Message Detection","fancy_title":"[Resource Topic] 2025/2072: Multi-server Fuzzy Message Detection","slug":"resource-topic-2025-2072-multi-server-fuzzy-message-detection","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T00:13:18.091Z","last_posted_at":"2025-11-13T00:13:18.236Z","bumped":true,"bumped_at":"2025-11-13T00:13:18.236Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2072"],"tags_descriptions":{"2025-2072":"Multi-server Fuzzy Message Detection"},"views":2,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25398,"title":"[Resource Topic] 2025/2067: Cryptographic Binding Should Not Be Optional: A Formal-Methods Analysis of FIDO UAF Channel Binding","fancy_title":"[Resource Topic] 2025/2067: Cryptographic Binding Should Not Be Optional: A Formal-Methods Analysis of FIDO UAF Channel Binding","slug":"resource-topic-2025-2067-cryptographic-binding-should-not-be-optional-a-formal-methods-analysis-of-fido-uaf-channel-binding","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T00:03:08.749Z","last_posted_at":"2025-11-13T00:03:08.900Z","bumped":true,"bumped_at":"2025-11-13T00:03:08.900Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2067"],"tags_descriptions":{"2025-2067":"Cryptographic Binding Should Not Be Optional: A Formal-Methods Analysis of FI..."},"views":2,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]},{"id":25397,"title":"[Resource Topic] 2025/2066: A Comprehensive Analysis of the AKMA+ Protocol","fancy_title":"[Resource Topic] 2025/2066: A Comprehensive Analysis of the AKMA+ Protocol","slug":"resource-topic-2025-2066-a-comprehensive-analysis-of-the-akma-protocol","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-13T00:03:08.011Z","last_posted_at":"2025-11-13T00:03:08.148Z","bumped":true,"bumped_at":"2025-11-13T00:03:08.148Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2066"],"tags_descriptions":{"2025-2066":"A Comprehensive Analysis of the AKMA+ Protocol"},"views":5,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":10,"pinned_globally":false,"featured_link":null,"has_accepted_answer":false,"posters":[{"extras":"latest single","description":"Original Poster, Most Recent Poster","user_id":-1,"primary_group_id":41,"flair_group_id":null}]}]}}