Abstract
Zero knowledge sets is a new cryptographic primary in- troduced by Micali, Rabin, and Kilian in FOCS 2003. It is intensively investigated recently. However all schemes follow the basic frame by Micali et al. That is, the schemes employ Merkle tree as basic frame and mercurial com- mitments as commitment units to nodes of the tree. The proof for any query constitutes of an authentication chain. We propose in this paper a new algebraic scheme that is completely different from all existing schemes. The new scheme is computationally secure under standard assump- tion: Strong RSA assumption. It employs neither mercurial commitments nor tree frame as all previous schemes did. In fact, the prover (also as the committer) in our construc- tion commits the desired set without trapdoor information, which is another important difference from the previous ap- proaches.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
