Independent Zero-Knowledge Sets
We define and construct Independent Zero-Knowledge Sets (ZKS) protocols. In a ZKS protocols, a Prover commits to a set S, and for any x, proves non-interactively to a Verifier if x ∈S or x ∉S without revealing any other information about S. In the independent ZKS protocols we introduce, the adversar...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 45 |
|---|---|
| container_issue | |
| container_start_page | 34 |
| container_title | |
| container_volume | |
| creator | Gennaro, Rosario Micali, Silvio |
| description | We define and construct Independent Zero-Knowledge Sets (ZKS) protocols. In a ZKS protocols, a Prover commits to a set S, and for any x, proves non-interactively to a Verifier if x ∈S or x ∉S without revealing any other information about S. In the independent ZKS protocols we introduce, the adversary is prevented from successfully correlate her set to the one of a honest prover. Our notion of independence in particular implies that the resulting ZKS protocol is non-malleable.
On the way to this result we define the notion of independence for commitment schemes. It is shown that this notion implies non-malleability, and we argue that this new notion has the potential to simplify the design and security proof of non-malleable commitment schemes.
Efficient implementations of ZKS protocols are based on the notion of mercurial commitments. Our efficient constructions of independent ZKS protocols requires the design of new commitment schemes that are simultaneously independent (and thus non-malleable) and mercurial. |
| doi_str_mv | 10.1007/11787006_4 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19993471</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19993471</sourcerecordid><originalsourceid>FETCH-LOGICAL-p218t-dabeccc64e117bc8b8be65a86a28d1ab25c1926bd0805ccffa577586fb2881763</originalsourceid><addsrcrecordid>eNpFkEtLw0AUhccX2NZu_AN2I7iJ3jvPO0spPooFF-rGzTAzmZRqTEImIP57I1XcnLM4H4fDYewU4RIBzBWiIQOgndxjc2tIKAlCWSDcZxPUiIUQ0h6w6V9g7CGbgABeWCPFMZvm_AYA3Fg-YWerpkxdGqUZFq-pb4uHpv2sU7lJi6c05BN2VPk6p_mvz9jL7c3z8r5YP96tltfrouNIQ1H6kGKMWqZxXogUKCStPGnPqUQfuIpouQ4lEKgYq8orYxTpKnAiNFrM2Pmut_M5-rrqfRO32XX99sP3Xw6ttUIaHLmLHZfHqNmk3oW2fc8Owf284_7fEd85i1CN</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Independent Zero-Knowledge Sets</title><source>Springer Books</source><creator>Gennaro, Rosario ; Micali, Silvio</creator><contributor>Preneel, Bart ; Bugliesi, Michele ; Wegener, Ingo ; Sassone, Vladimiro</contributor><creatorcontrib>Gennaro, Rosario ; Micali, Silvio ; Preneel, Bart ; Bugliesi, Michele ; Wegener, Ingo ; Sassone, Vladimiro</creatorcontrib><description>We define and construct Independent Zero-Knowledge Sets (ZKS) protocols. In a ZKS protocols, a Prover commits to a set S, and for any x, proves non-interactively to a Verifier if x ∈S or x ∉S without revealing any other information about S. In the independent ZKS protocols we introduce, the adversary is prevented from successfully correlate her set to the one of a honest prover. Our notion of independence in particular implies that the resulting ZKS protocol is non-malleable.
On the way to this result we define the notion of independence for commitment schemes. It is shown that this notion implies non-malleability, and we argue that this new notion has the potential to simplify the design and security proof of non-malleable commitment schemes.
Efficient implementations of ZKS protocols are based on the notion of mercurial commitments. Our efficient constructions of independent ZKS protocols requires the design of new commitment schemes that are simultaneously independent (and thus non-malleable) and mercurial.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540359079</identifier><identifier>ISBN: 9783540359074</identifier><identifier>ISBN: 3540359044</identifier><identifier>ISBN: 9783540359043</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540359081</identifier><identifier>EISBN: 3540359087</identifier><identifier>DOI: 10.1007/11787006_4</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Automata. Abstract machines. Turing machines ; Commitment Scheme ; Computer science; control theory; systems ; Exact sciences and technology ; Honest Party ; Signature Scheme ; Springer LNCS ; Strong Independence ; Theoretical computing</subject><ispartof>Automata, Languages and Programming, 2006, p.34-45</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2008 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11787006_4$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11787006_4$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4048,4049,27923,38253,41440,42509</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19993471$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Preneel, Bart</contributor><contributor>Bugliesi, Michele</contributor><contributor>Wegener, Ingo</contributor><contributor>Sassone, Vladimiro</contributor><creatorcontrib>Gennaro, Rosario</creatorcontrib><creatorcontrib>Micali, Silvio</creatorcontrib><title>Independent Zero-Knowledge Sets</title><title>Automata, Languages and Programming</title><description>We define and construct Independent Zero-Knowledge Sets (ZKS) protocols. In a ZKS protocols, a Prover commits to a set S, and for any x, proves non-interactively to a Verifier if x ∈S or x ∉S without revealing any other information about S. In the independent ZKS protocols we introduce, the adversary is prevented from successfully correlate her set to the one of a honest prover. Our notion of independence in particular implies that the resulting ZKS protocol is non-malleable.
On the way to this result we define the notion of independence for commitment schemes. It is shown that this notion implies non-malleability, and we argue that this new notion has the potential to simplify the design and security proof of non-malleable commitment schemes.
Efficient implementations of ZKS protocols are based on the notion of mercurial commitments. Our efficient constructions of independent ZKS protocols requires the design of new commitment schemes that are simultaneously independent (and thus non-malleable) and mercurial.</description><subject>Applied sciences</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Commitment Scheme</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Honest Party</subject><subject>Signature Scheme</subject><subject>Springer LNCS</subject><subject>Strong Independence</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540359079</isbn><isbn>9783540359074</isbn><isbn>3540359044</isbn><isbn>9783540359043</isbn><isbn>9783540359081</isbn><isbn>3540359087</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkEtLw0AUhccX2NZu_AN2I7iJ3jvPO0spPooFF-rGzTAzmZRqTEImIP57I1XcnLM4H4fDYewU4RIBzBWiIQOgndxjc2tIKAlCWSDcZxPUiIUQ0h6w6V9g7CGbgABeWCPFMZvm_AYA3Fg-YWerpkxdGqUZFq-pb4uHpv2sU7lJi6c05BN2VPk6p_mvz9jL7c3z8r5YP96tltfrouNIQ1H6kGKMWqZxXogUKCStPGnPqUQfuIpouQ4lEKgYq8orYxTpKnAiNFrM2Pmut_M5-rrqfRO32XX99sP3Xw6ttUIaHLmLHZfHqNmk3oW2fc8Owf284_7fEd85i1CN</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Gennaro, Rosario</creator><creator>Micali, Silvio</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Independent Zero-Knowledge Sets</title><author>Gennaro, Rosario ; Micali, Silvio</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p218t-dabeccc64e117bc8b8be65a86a28d1ab25c1926bd0805ccffa577586fb2881763</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Commitment Scheme</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Honest Party</topic><topic>Signature Scheme</topic><topic>Springer LNCS</topic><topic>Strong Independence</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gennaro, Rosario</creatorcontrib><creatorcontrib>Micali, Silvio</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gennaro, Rosario</au><au>Micali, Silvio</au><au>Preneel, Bart</au><au>Bugliesi, Michele</au><au>Wegener, Ingo</au><au>Sassone, Vladimiro</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Independent Zero-Knowledge Sets</atitle><btitle>Automata, Languages and Programming</btitle><date>2006</date><risdate>2006</risdate><spage>34</spage><epage>45</epage><pages>34-45</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540359079</isbn><isbn>9783540359074</isbn><isbn>3540359044</isbn><isbn>9783540359043</isbn><eisbn>9783540359081</eisbn><eisbn>3540359087</eisbn><abstract>We define and construct Independent Zero-Knowledge Sets (ZKS) protocols. In a ZKS protocols, a Prover commits to a set S, and for any x, proves non-interactively to a Verifier if x ∈S or x ∉S without revealing any other information about S. In the independent ZKS protocols we introduce, the adversary is prevented from successfully correlate her set to the one of a honest prover. Our notion of independence in particular implies that the resulting ZKS protocol is non-malleable.
On the way to this result we define the notion of independence for commitment schemes. It is shown that this notion implies non-malleability, and we argue that this new notion has the potential to simplify the design and security proof of non-malleable commitment schemes.
Efficient implementations of ZKS protocols are based on the notion of mercurial commitments. Our efficient constructions of independent ZKS protocols requires the design of new commitment schemes that are simultaneously independent (and thus non-malleable) and mercurial.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11787006_4</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Automata, Languages and Programming, 2006, p.34-45 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19993471 |
| source | Springer Books |
| subjects | Applied sciences Automata. Abstract machines. Turing machines Commitment Scheme Computer science control theory systems Exact sciences and technology Honest Party Signature Scheme Springer LNCS Strong Independence Theoretical computing |
| title | Independent Zero-Knowledge Sets |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T21%3A35%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Independent%20Zero-Knowledge%20Sets&rft.btitle=Automata,%20Languages%20and%20Programming&rft.au=Gennaro,%20Rosario&rft.date=2006&rft.spage=34&rft.epage=45&rft.pages=34-45&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540359079&rft.isbn_list=9783540359074&rft.isbn_list=3540359044&rft.isbn_list=9783540359043&rft_id=info:doi/10.1007/11787006_4&rft_dat=%3Cpascalfrancis_sprin%3E19993471%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540359081&rft.eisbn_list=3540359087&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |