{"id":3089,"date":"2026-10-31T15:43:08","date_gmt":"2026-10-31T15:43:08","guid":{"rendered":"https:\/\/wyominginvest.com\/?p=3089"},"modified":"2026-10-31T15:43:08","modified_gmt":"2026-10-31T15:43:08","slug":"rerandomizable-garbling-beyond-bhho-kmhe-and-a-construction-from-lwe","status":"publish","type":"post","link":"https:\/\/wyominginvest.com\/?p=3089","title":{"rendered":"Rerandomizable Garbling Beyond BHHO-KMHE and a Construction from LWE"},"content":{"rendered":"<p>Rerandomizable garbling schemes represent a fundamental primitive in contemporary cryptography, acting as core building blocks that enable several advanced cryptographic constructions. These include multi-hop homomorphic encryption, initially introduced by Gentry, Halevi, and Vaikuntanathan at CRYPTO 2010; indistinguishability obfuscation (iO) combiners, presented by Ananth, Jain, Naor, Sahai, and Yogev at CRYPTO 2016; and You-Only-Speak-Once (YOSO) style secure multi-party computation protocols, developed by Acharya, Hazay, Kolesnikov, Prabhakaran, and TCC\/CRYPTO researchers between 2022 and 2024. Despite their widespread utility in privacy-preserving computations, all previously known instantiations of RGS shared a common limitation: they relied strictly on discrete-logarithm-type assumptions.<\/p>\n<p>Historically, this reliance manifested through the classic BHHO scheme\u2014originated by Boneh, Halevi, Hamburg, and Ostrovsky at CRYPTO 2008\u2014alongside its recent pairing-based variant formulated by Heitjohann, von der Heyden, and Jager at CRYPTO 2025. The root cause of this limitation lies in the traditional reliance on key-and-message homomorphic encryption (KMHE) systems. These traditional systems must support rerandomization while simultaneously satisfying strict &quot;key-privacy under leakage&quot; properties. Such properties are vital because they hide the applied homomorphic transformations from potential adversaries. Previously, achieving this level of security required utilizing BHHO-style bitwise encryption meticulously combined with permutation-based homomorphisms, thereby binding the entire framework to discrete logarithm structures.<\/p>\n<p>Addressing this long-standing constraint, the University of Wuppertal research team formulated their first main contribution: an entirely new garbling technique. Instead of forcing the underlying encryption scheme to bear the heavy burden of concealing homomorphic transformations, the new method shifts that responsibility directly into the garbling process itself. By redefining where this security guarantee is enforced, the authors have successfully constructed rerandomizable garbling schemes from KMHE schemes that possess substantially weaker properties. <\/p>\n<p>This architectural shift eliminates the necessity for bitwise encryption and permutation-based homomorphisms altogether. Consequently, the new framework enables the successful construction of RGS from alternative classes of KMHE, such as additively-homomorphic encryption schemes. By decoupling rerandomizable garbling from the rigid constraints of discrete logarithm assumptions, the research fundamentally expands the theoretical toolkit available to cryptographic designers.<\/p>\n<p>Building upon this theoretical advancement, the researchers delivered their second major contribution: a concrete, lattice-based instantiation of the required KMHE primitive anchored in the learning-with-errors (LWE) assumption. Lattice-based cryptography is widely regarded by cryptographers as one of the most reliable frontiers for safeguarding digital infrastructure against the eventual advent of quantum computers, which could easily compromise traditional number-theoretic assumptions like integer factorization and discrete logarithms.<\/p>\n<p>The team&#8217;s LWE-based construction is structured as a specialized variant of the well-known GSW fully homomorphic encryption scheme, originally introduced by Gentry, Sahai, and Waters at CRYPTO 2013. To make the GSW framework compatible with their goals, the Wuppertal researchers developed novel techniques for rerandomization. Furthermore, they tailored the construction specifically to the demands of their new garbling scheme by engineering support for a dual &quot;homomorphic&quot; and &quot;lossy&quot; operational mode. <\/p>\n<p>By uniting this customized lattice-based primitive with their innovative garbling technique, the authors have achieved a historic milestone in the field: the very first RGS construction that completely bypasses discrete-logarithm assumptions. Because the underlying LWE assumption is widely believed to remain secure against quantum adversaries, this research establishes a vital bridge toward achieving post-quantum security for complex cryptographic applications like YOSO-style multi-party computation and advanced obfuscation protocols.<\/p>\n<p>The complete research paper, titled &quot;Rerandomizable Garbling Beyond BHHO-KMHE and a Construction from LWE,&quot; is publicly available on the Cryptology ePrint Archive under paper number 2026\/2664 for researchers and practitioners interested in the mathematical proofs and technical specifications of the new lattice-based construction.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Rerandomizable garbling schemes represent a fundamental primitive in contemporary cryptography, acting as core building blocks that enable several advanced cryptographic constructions. These include multi-hop homomorphic encryption, initially introduced by Gentry, Halevi, and Vaikuntanathan at CRYPTO 2010; indistinguishability obfuscation (iO) combiners, presented by Ananth, Jain, Naor, Sahai, and Yogev at CRYPTO 2016; and You-Only-Speak-Once (YOSO) style<\/p>\n","protected":false},"author":15,"featured_media":3088,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[672],"tags":[674,1619,2666,2668,603,2665,2667,673,2664,214],"class_list":["post-3089","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-cryptography-math","tag-algorithms","tag-beyond","tag-bhho","tag-construction","tag-cryptography","tag-garbling","tag-kmhe","tag-math","tag-rerandomizable","tag-research"],"_links":{"self":[{"href":"https:\/\/wyominginvest.com\/index.php?rest_route=\/wp\/v2\/posts\/3089","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wyominginvest.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wyominginvest.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wyominginvest.com\/index.php?rest_route=\/wp\/v2\/users\/15"}],"replies":[{"embeddable":true,"href":"https:\/\/wyominginvest.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3089"}],"version-history":[{"count":0,"href":"https:\/\/wyominginvest.com\/index.php?rest_route=\/wp\/v2\/posts\/3089\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/wyominginvest.com\/index.php?rest_route=\/wp\/v2\/media\/3088"}],"wp:attachment":[{"href":"https:\/\/wyominginvest.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3089"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wyominginvest.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=3089"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wyominginvest.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=3089"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}