Unknown order in cryptography refers to a mathematical group whose order, or the number of elements it contains, is not publicly known. Cryptographic schemes built upon groups of unknown order often derive their security from the computational difficulty of factoring large numbers. This property is used in certain zero-knowledge proofs and other advanced cryptographic constructions. It complicates attacks that rely on knowing the group’s structure.
Context
Cryptographic systems relying on groups of unknown order are a subject of ongoing research, particularly in the context of privacy-preserving technologies and secure multi-party computation. Discussions often concern the trade-offs between the security assurances provided by unknown order groups and the computational efficiency of operations within them. Future developments will likely involve exploring new constructions and practical applications that effectively leverage the security properties of these mathematical structures.
This research introduces novel ZK arguments for the CL cryptosystem, enabling private, verifiable computations in unknown order groups for enhanced privacy.
We use cookies to personalize content and marketing, and to analyze our traffic. This helps us maintain the quality of our free resources. manage your preferences below.
Detailed Cookie Preferences
This helps support our free resources through personalized marketing efforts and promotions.
Analytics cookies help us understand how visitors interact with our website, improving user experience and website performance.
Personalization cookies enable us to customize the content and features of our site based on your interactions, offering a more tailored experience.
