{"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/no-category/15?page=1","per_page":30,"top_tags":["1996-001","1996-002","1996-003","1996-004"],"topics":[{"id":25431,"title":"[Resource Topic] 2025/2100: Tag Functions and Their Applications to Lattice-based Signatures and IBEs — Compact Designs and Tighter Security","fancy_title":"[Resource Topic] 2025/2100: Tag Functions and Their Applications to Lattice-based Signatures and IBEs — Compact Designs and Tighter Security","slug":"resource-topic-2025-2100-tag-functions-and-their-applications-to-lattice-based-signatures-and-ibes-compact-designs-and-tighter-security","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-17T02:04:43.607Z","last_posted_at":"2025-11-17T02:04:43.793Z","bumped":true,"bumped_at":"2025-11-17T02:04:43.793Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2100"],"tags_descriptions":{"2025-2100":"Tag Functions and Their Applications to Lattice-based Signatures and IBEs — C..."},"views":6,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":25388,"title":"[Resource Topic] 2025/2057: Distributed Key Generation for Efficient Threshold-CKKS","fancy_title":"[Resource Topic] 2025/2057: Distributed Key Generation for Efficient Threshold-CKKS","slug":"resource-topic-2025-2057-distributed-key-generation-for-efficient-threshold-ckks","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-11-09T18:33:35.997Z","last_posted_at":"2025-11-09T18:33:36.125Z","bumped":true,"bumped_at":"2025-11-09T18:33:36.125Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-2057"],"tags_descriptions":{"2025-2057":"Distributed Key Generation for Efficient Threshold-CKKS"},"views":10,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":25180,"title":"[Resource Topic] 2025/1856: Optimal Good-Case Latency for Sleepy Consensus","fancy_title":"[Resource Topic] 2025/1856: Optimal Good-Case Latency for Sleepy Consensus","slug":"resource-topic-2025-1856-optimal-good-case-latency-for-sleepy-consensus","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-10-08T04:44:31.531Z","last_posted_at":"2025-10-08T04:44:31.636Z","bumped":true,"bumped_at":"2025-10-08T04:44:31.636Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1856"],"tags_descriptions":{"2025-1856":"Optimal Good-Case Latency for Sleepy Consensus"},"views":5,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":25153,"title":"[Resource Topic] 2025/1829: On the Limits of Consensus under Dynamic Availability and Reconfiguration","fancy_title":"[Resource Topic] 2025/1829: On the Limits of Consensus under Dynamic Availability and Reconfiguration","slug":"resource-topic-2025-1829-on-the-limits-of-consensus-under-dynamic-availability-and-reconfiguration","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-10-08T03:23:38.790Z","last_posted_at":"2025-10-08T03:23:38.898Z","bumped":true,"bumped_at":"2025-10-08T03:23:38.898Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1829"],"tags_descriptions":{"2025-1829":"On the Limits of Consensus under Dynamic Availability and Reconfiguration"},"views":3,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":25128,"title":"[Resource Topic] 2025/1804: HELIOS: Multi-Key Fully Homomorphic Encryption with Sublinear Bootstrapping","fancy_title":"[Resource Topic] 2025/1804: HELIOS: Multi-Key Fully Homomorphic Encryption with Sublinear Bootstrapping","slug":"resource-topic-2025-1804-helios-multi-key-fully-homomorphic-encryption-with-sublinear-bootstrapping","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-10-08T02:48:02.898Z","last_posted_at":"2025-10-08T02:48:03.023Z","bumped":true,"bumped_at":"2025-10-08T02:48:03.023Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1804"],"tags_descriptions":{"2025-1804":"HELIOS: Multi-Key Fully Homomorphic Encryption with Sublinear Bootstrapping"},"views":6,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":25110,"title":"[Resource Topic] 2025/1786: Leveraging Discrete CKKS to Bootstrap in High Precision","fancy_title":"[Resource Topic] 2025/1786: Leveraging Discrete CKKS to Bootstrap in High Precision","slug":"resource-topic-2025-1786-leveraging-discrete-ckks-to-bootstrap-in-high-precision","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-10-03T07:15:16.258Z","last_posted_at":"2025-10-03T07:15:16.349Z","bumped":true,"bumped_at":"2025-10-03T07:15:16.349Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1786"],"tags_descriptions":{"2025-1786":"Leveraging Discrete CKKS to Bootstrap in High Precision"},"views":4,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":25097,"title":"[Resource Topic] 2025/1773: Impossibility of VDFs in the ROM: The Complete Picture","fancy_title":"[Resource Topic] 2025/1773: Impossibility of VDFs in the ROM: The Complete Picture","slug":"resource-topic-2025-1773-impossibility-of-vdfs-in-the-rom-the-complete-picture","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-10-03T07:05:00.980Z","last_posted_at":"2025-10-03T07:05:01.110Z","bumped":true,"bumped_at":"2025-10-03T07:05:01.110Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1773"],"tags_descriptions":{"2025-1773":"Impossibility of VDFs in the ROM: The Complete Picture"},"views":14,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":25096,"title":"[Resource Topic] 2025/1772: Multiple Concurrent Proposers: Why and How","fancy_title":"[Resource Topic] 2025/1772: Multiple Concurrent Proposers: Why and How","slug":"resource-topic-2025-1772-multiple-concurrent-proposers-why-and-how","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-10-03T06:59:57.822Z","last_posted_at":"2025-10-03T06:59:57.924Z","bumped":true,"bumped_at":"2025-10-03T06:59:57.924Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1772"],"tags_descriptions":{"2025-1772":"Multiple Concurrent Proposers: Why and How"},"views":1,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":25076,"title":"[Resource Topic] 2025/1752: Foundations of Dynamic Group Signatures: The Case of Malicious Openers and Issuers","fancy_title":"[Resource Topic] 2025/1752: Foundations of Dynamic Group Signatures: The Case of Malicious Openers and Issuers","slug":"resource-topic-2025-1752-foundations-of-dynamic-group-signatures-the-case-of-malicious-openers-and-issuers","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-09-26T01:50:39.456Z","last_posted_at":"2025-09-26T01:50:39.590Z","bumped":true,"bumped_at":"2025-09-26T01:50:39.590Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1752"],"tags_descriptions":{"2025-1752":"Foundations of Dynamic Group Signatures: The Case of Malicious Openers and Is..."},"views":12,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":25050,"title":"[Resource Topic] 2025/1726: How (not) to Build Identity-Based Encryption from Isogenies","fancy_title":"[Resource Topic] 2025/1726: How (not) to Build Identity-Based Encryption from Isogenies","slug":"resource-topic-2025-1726-how-not-to-build-identity-based-encryption-from-isogenies","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-09-23T00:26:23.101Z","last_posted_at":"2025-09-23T00:26:23.236Z","bumped":true,"bumped_at":"2025-09-23T00:26:23.236Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1726"],"tags_descriptions":{"2025-1726":"How (not) to Build Identity-Based Encryption from Isogenies"},"views":7,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":25045,"title":"[Resource Topic] 2025/1721: Q-Stream: A Practical System for Operational Perfect Secrecy","fancy_title":"[Resource Topic] 2025/1721: Q-Stream: A Practical System for Operational Perfect Secrecy","slug":"resource-topic-2025-1721-q-stream-a-practical-system-for-operational-perfect-secrecy","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-09-23T00:26:19.139Z","last_posted_at":"2025-09-23T00:26:19.267Z","bumped":true,"bumped_at":"2025-09-23T00:26:19.267Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1721"],"tags_descriptions":{"2025-1721":"Q-Stream: A Practical System for Operational Perfect Secrecy"},"views":10,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24851,"title":"[Resource Topic] 2025/1530: PolySys: an Algebraic Leakage Attack Engine","fancy_title":"[Resource Topic] 2025/1530: PolySys: an Algebraic Leakage Attack Engine","slug":"resource-topic-2025-1530-polysys-an-algebraic-leakage-attack-engine","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-08-30T17:28:08.975Z","last_posted_at":"2025-08-30T17:28:09.095Z","bumped":true,"bumped_at":"2025-08-30T17:28:09.095Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1530"],"tags_descriptions":{"2025-1530":"PolySys: an Algebraic Leakage Attack Engine"},"views":11,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24818,"title":"[Resource Topic] 2025/1499: A Construction of Evolving $k$-threshold Secret Sharing Scheme over A Polynomial Ring","fancy_title":"[Resource Topic] 2025/1499: A Construction of Evolving $k$-threshold Secret Sharing Scheme over A Polynomial Ring","slug":"resource-topic-2025-1499-a-construction-of-evolving-k-threshold-secret-sharing-scheme-over-a-polynomial-ring","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-08-28T08:34:02.673Z","last_posted_at":"2025-08-28T08:34:02.795Z","bumped":true,"bumped_at":"2025-08-28T08:34:02.795Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1499"],"tags_descriptions":{"2025-1499":"A Construction of Evolving $k$-threshold Secret Sharing Scheme over A Polynom..."},"views":1,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24816,"title":"[Resource Topic] 2025/1497: Hardness Along the Boundary: Towards One-Way Functions from the Worst-case Hardness of Time-Bounded Kolmogorov Complexity","fancy_title":"[Resource Topic] 2025/1497: Hardness Along the Boundary: Towards One-Way Functions from the Worst-case Hardness of Time-Bounded Kolmogorov Complexity","slug":"resource-topic-2025-1497-hardness-along-the-boundary-towards-one-way-functions-from-the-worst-case-hardness-of-time-bounded-kolmogorov-complexity","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-08-28T08:34:01.005Z","last_posted_at":"2025-08-28T08:34:01.132Z","bumped":true,"bumped_at":"2025-08-28T08:34:01.132Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1497"],"tags_descriptions":{"2025-1497":"Hardness Along the Boundary: Towards One-Way Functions from the Worst-case Ha..."},"views":10,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24774,"title":"[Resource Topic] 2025/1455: Fully-Fluctuating Participation in Sleepy Consensus","fancy_title":"[Resource Topic] 2025/1455: Fully-Fluctuating Participation in Sleepy Consensus","slug":"resource-topic-2025-1455-fully-fluctuating-participation-in-sleepy-consensus","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-08-12T19:35:55.108Z","last_posted_at":"2025-08-12T19:35:55.220Z","bumped":true,"bumped_at":"2025-08-12T19:35:55.220Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1455"],"tags_descriptions":{"2025-1455":"Fully-Fluctuating Participation in Sleepy Consensus"},"views":5,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24710,"title":"[Resource Topic] 2025/1393: Polynomial Lattices for the BIKE Cryptosystem","fancy_title":"[Resource Topic] 2025/1393: Polynomial Lattices for the BIKE Cryptosystem","slug":"resource-topic-2025-1393-polynomial-lattices-for-the-bike-cryptosystem","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-08-01T11:00:12.919Z","last_posted_at":"2025-08-01T11:00:13.037Z","bumped":true,"bumped_at":"2025-08-01T11:00:13.037Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1393"],"tags_descriptions":{"2025-1393":"Polynomial Lattices for the BIKE Cryptosystem"},"views":4,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24647,"title":"[Resource Topic] 2025/1332: Technical Note: LeanSig for Post-Quantum Ethereum","fancy_title":"[Resource Topic] 2025/1332: Technical Note: LeanSig for Post-Quantum Ethereum","slug":"resource-topic-2025-1332-technical-note-leansig-for-post-quantum-ethereum","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-07-22T21:54:08.755Z","last_posted_at":"2025-07-22T21:54:08.864Z","bumped":true,"bumped_at":"2025-07-22T21:54:08.864Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1332"],"tags_descriptions":{"2025-1332":"Technical Note: LeanSig for Post-Quantum Ethereum"},"views":4,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24617,"title":"[Resource Topic] 2025/1302: FHERMA Cookbook: FHE Components for Privacy-Preserving Applications","fancy_title":"[Resource Topic] 2025/1302: FHERMA Cookbook: FHE Components for Privacy-Preserving Applications","slug":"resource-topic-2025-1302-fherma-cookbook-fhe-components-for-privacy-preserving-applications","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-07-19T06:27:55.567Z","last_posted_at":"2025-07-19T06:27:55.669Z","bumped":true,"bumped_at":"2025-07-19T06:27:55.669Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1302"],"tags_descriptions":{"2025-1302":"FHERMA Cookbook: FHE Components for Privacy-Preserving Applications"},"views":6,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24559,"title":"[Resource Topic] 2025/1244: A New Bijective Pairing Alternative for Encoding Natural Numbers","fancy_title":"[Resource Topic] 2025/1244: A New Bijective Pairing Alternative for Encoding Natural Numbers","slug":"resource-topic-2025-1244-a-new-bijective-pairing-alternative-for-encoding-natural-numbers","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-07-11T22:44:18.000Z","last_posted_at":"2025-07-11T22:44:18.109Z","bumped":true,"bumped_at":"2025-07-11T22:44:18.109Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1244"],"tags_descriptions":{"2025-1244":"A New Bijective Pairing Alternative for Encoding Natural Numbers"},"views":5,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24425,"title":"[Resource Topic] 2025/1115: High-Throughput Permissionless Blockchain Consensus under Realistic Network Assumptions","fancy_title":"[Resource Topic] 2025/1115: High-Throughput Permissionless Blockchain Consensus under Realistic Network Assumptions","slug":"resource-topic-2025-1115-high-throughput-permissionless-blockchain-consensus-under-realistic-network-assumptions","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-06-16T21:05:55.807Z","last_posted_at":"2025-06-16T21:05:55.939Z","bumped":true,"bumped_at":"2025-06-16T21:05:55.939Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1115"],"tags_descriptions":{"2025-1115":"High-Throughput Permissionless Blockchain Consensus under   Realistic Network..."},"views":8,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24415,"title":"[Resource Topic] 2025/1105: Low-cost anonymous reputation update for IoT applications","fancy_title":"[Resource Topic] 2025/1105: Low-cost anonymous reputation update for IoT applications","slug":"resource-topic-2025-1105-low-cost-anonymous-reputation-update-for-iot-applications","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-06-13T08:50:42.073Z","last_posted_at":"2025-06-13T08:50:42.160Z","bumped":true,"bumped_at":"2025-06-13T08:50:42.160Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1105"],"tags_descriptions":{"2025-1105":"Low-cost anonymous reputation update for IoT applications"},"views":14,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24387,"title":"[Resource Topic] 2025/1077: Shorter VOLE-in-the-Head-based Signatures from Vector Semi-Commitment","fancy_title":"[Resource Topic] 2025/1077: Shorter VOLE-in-the-Head-based Signatures from Vector Semi-Commitment","slug":"resource-topic-2025-1077-shorter-vole-in-the-head-based-signatures-from-vector-semi-commitment","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-06-10T14:24:13.361Z","last_posted_at":"2025-06-10T14:24:13.475Z","bumped":true,"bumped_at":"2025-06-10T14:24:13.475Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-1077"],"tags_descriptions":{"2025-1077":"Shorter VOLE-in-the-Head-based Signatures from Vector Semi-Commitment"},"views":9,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24265,"title":"[Resource Topic] 2025/958: Efficient Pairings Final Exponentiation Using Cyclotomic Cubing for Odd Embedding Degrees Curves","fancy_title":"[Resource Topic] 2025/958: Efficient Pairings Final Exponentiation Using Cyclotomic Cubing for Odd Embedding Degrees Curves","slug":"resource-topic-2025-958-efficient-pairings-final-exponentiation-using-cyclotomic-cubing-for-odd-embedding-degrees-curves","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-05-27T19:11:37.710Z","last_posted_at":"2025-05-27T19:11:37.817Z","bumped":true,"bumped_at":"2025-05-27T19:11:37.817Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-958"],"tags_descriptions":{"2025-958":"Efficient Pairings Final Exponentiation Using Cyclotomic Cubing for Odd Embed..."},"views":9,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24199,"title":"[Resource Topic] 2025/893: MacaKey: Full-State Keyed Sponge Meets the Summation-Truncation Hybrid","fancy_title":"[Resource Topic] 2025/893: MacaKey: Full-State Keyed Sponge Meets the Summation-Truncation Hybrid","slug":"resource-topic-2025-893-macakey-full-state-keyed-sponge-meets-the-summation-truncation-hybrid","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-05-19T19:53:30.693Z","last_posted_at":"2025-05-19T19:53:30.768Z","bumped":true,"bumped_at":"2025-05-19T19:53:30.768Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-893"],"tags_descriptions":{"2025-893":"MacaKey: Full-State Keyed Sponge Meets the Summation-Truncation Hybrid"},"views":11,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24192,"title":"[Resource Topic] 2025/886: PaCo: Bootstrapping for CKKS via Partial CoeffToSlot","fancy_title":"[Resource Topic] 2025/886: PaCo: Bootstrapping for CKKS via Partial CoeffToSlot","slug":"resource-topic-2025-886-paco-bootstrapping-for-ckks-via-partial-coefftoslot","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-05-19T10:21:09.479Z","last_posted_at":"2025-05-19T10:21:09.585Z","bumped":true,"bumped_at":"2025-05-19T10:21:09.585Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-886"],"tags_descriptions":{"2025-886":"PaCo: Bootstrapping for CKKS via Partial CoeffToSlot"},"views":21,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24177,"title":"[Resource Topic] 2025/871: Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts","fancy_title":"[Resource Topic] 2025/871: Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts","slug":"resource-topic-2025-871-simple-and-efficient-lattice-threshold-signatures-with-identifiable-aborts","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-05-19T09:55:48.829Z","last_posted_at":"2025-05-19T09:55:48.923Z","bumped":true,"bumped_at":"2025-05-19T09:55:48.923Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-871"],"tags_descriptions":{"2025-871":"Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts"},"views":22,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24141,"title":"[Resource Topic] 2025/835: Universally Composable Interactive and Ordered Multi-Signatures","fancy_title":"[Resource Topic] 2025/835: Universally Composable Interactive and Ordered Multi-Signatures","slug":"resource-topic-2025-835-universally-composable-interactive-and-ordered-multi-signatures","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-05-12T02:48:42.115Z","last_posted_at":"2025-05-12T02:48:42.209Z","bumped":true,"bumped_at":"2025-05-12T02:48:42.209Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-835"],"tags_descriptions":{"2025-835":"Universally Composable Interactive and Ordered Multi-Signatures"},"views":17,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24090,"title":"[Resource Topic] 2025/784: SHIP: A Shallow and Highly Parallelizable CKKS Bootstrapping Algorithm","fancy_title":"[Resource Topic] 2025/784: SHIP: A Shallow and Highly Parallelizable CKKS Bootstrapping Algorithm","slug":"resource-topic-2025-784-ship-a-shallow-and-highly-parallelizable-ckks-bootstrapping-algorithm","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-05-04T15:10:08.859Z","last_posted_at":"2025-05-04T15:10:08.994Z","bumped":true,"bumped_at":"2025-05-04T15:10:08.994Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-784"],"tags_descriptions":{"2025-784":"SHIP: A Shallow and Highly Parallelizable CKKS Bootstrapping Algorithm"},"views":20,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":24068,"title":"[Resource Topic] 2025/762: $\\textbf{MALARIA}$: $\\textbf{Ma}$nagement of Low-$\\textbf{La}$tency $\\textbf{R}$outing $\\textbf{I}$mpact on Mix Network $\\textbf{A}$nonymity (Extended Version)","fancy_title":"[Resource Topic] 2025/762: $\\textbf{MALARIA}$: $\\textbf{Ma}$nagement of Low-$\\textbf{La}$tency $\\textbf{R}$outing $\\textbf{I}$mpact on Mix Network $\\textbf{A}$nonymity (Extended Version)","slug":"resource-topic-2025-762-textbf-malaria-textbf-ma-nagement-of-low-textbf-la-tency-textbf-r-outing-textbf-i-mpact-on-mix-network-textbf-a-nonymity-extended-version","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-04-30T12:16:17.884Z","last_posted_at":"2025-04-30T12:16:18.041Z","bumped":true,"bumped_at":"2025-04-30T12:16:18.041Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-762"],"tags_descriptions":{"2025-762":"$\\textbf{MALARIA}$: $\\textbf{Ma}$nagement of Low-$\\textbf{La}$tency $\\textbf{..."},"views":12,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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":23999,"title":"[Resource Topic] 2025/693: Accountable Liveness","fancy_title":"[Resource Topic] 2025/693: Accountable Liveness","slug":"resource-topic-2025-693-accountable-liveness","posts_count":1,"reply_count":0,"highest_post_number":1,"image_url":null,"created_at":"2025-04-17T02:34:09.091Z","last_posted_at":"2025-04-17T02:34:09.213Z","bumped":true,"bumped_at":"2025-04-17T02:34:09.213Z","archetype":"regular","unseen":false,"pinned":false,"unpinned":null,"visible":true,"closed":false,"archived":false,"bookmarked":null,"liked":null,"tags":["2025-693"],"tags_descriptions":{"2025-693":"Accountable Liveness"},"views":15,"like_count":0,"has_summary":false,"last_poster_username":"system","category_id":15,"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}]}]}}