Generalized Combinatoric Accumulator

Generalized Combinatoric Accumulator

The accumulator was introduced as a decentralized alternative to digital signatures. While most of accumulators are based on number theoretic assumptions and require time-consuming modulo exponentiations, Nyberg's combinatoric accumulator dose not depend on any computational assumption and requ...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Information and Systems 2008/05/01, Vol.E91.D(5), pp.1489-1491
Hauptverfasser: YUM, Dae Hyun, SEO, Jae Woo, LEE, Pil Joong
Format: Artikel
Sprache:eng
Schlagworte:
accumulated hash function
Accumulators
Combinatorial analysis
Cryptography
Decentralized
Digital signatures
Hash based algorithms
Mathematical analysis
Mathematical models
one-way accumulator
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1491
container_issue 5
container_start_page 1489
container_title IEICE Transactions on Information and Systems
container_volume E91.D
creator YUM, Dae Hyun
SEO, Jae Woo
LEE, Pil Joong
description The accumulator was introduced as a decentralized alternative to digital signatures. While most of accumulators are based on number theoretic assumptions and require time-consuming modulo exponentiations, Nyberg's combinatoric accumulator dose not depend on any computational assumption and requires only bit operations and hash function evaluations. In this article, we present a generalization of Nyberg's combinatoric accumulator, which allows a lower false positive rate with the same output length. Our generalization also shows that the Bloom filter can be used as a cryptographic accumulator and moreover excels the Nyberg's accumulator.
doi_str_mv 10.1093/ietisy/e91-d.5.1489
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_864404977</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>864404977</sourcerecordid><originalsourceid>FETCH-LOGICAL-c561t-eedd817ca122de0e9400ef20ae3b5056a617262dfb86afa47335c71f6e830aad3</originalsourceid><addsrcrecordid>eNo9kD9PwzAQRy0EEqXwCVg6IDGl9cWxk4xVKQVRiQVm62pfwFX-FDsZyqdvokCnn05674bH2D3wOfBcLBy1LhwXlENk53IOSZZfsAmkiYxAKLhkE56DijIp4mt2E8Kec8hikBP2sKGaPJbul-xs1VQ7V2PbeGdmS2O6qiuH65ZdFVgGuvvbKft8Xn-sXqLt--Z1tdxGRipoIyJrM0gNQhxb4pQnnFMRcySxk1wqVJDGKrbFLlNYYJIKIU0KhaJMcEQrpuxx_HvwzU9HodWVC4bKEmtquqAzlSQ8ydO0J8VIGt-E4KnQB-8q9EcNXA9J9JhE90m01VIPSXrrbbT2ocUvOjvoW2dK0q3HOri60Oveeuqt_x3sM2W-0WuqxQl9DnI4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>864404977</pqid></control><display><type>article</type><title>Generalized Combinatoric Accumulator</title><source>J-STAGE Free</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>YUM, Dae Hyun ; SEO, Jae Woo ; LEE, Pil Joong</creator><creatorcontrib>YUM, Dae Hyun ; SEO, Jae Woo ; LEE, Pil Joong</creatorcontrib><description>The accumulator was introduced as a decentralized alternative to digital signatures. While most of accumulators are based on number theoretic assumptions and require time-consuming modulo exponentiations, Nyberg's combinatoric accumulator dose not depend on any computational assumption and requires only bit operations and hash function evaluations. In this article, we present a generalization of Nyberg's combinatoric accumulator, which allows a lower false positive rate with the same output length. Our generalization also shows that the Bloom filter can be used as a cryptographic accumulator and moreover excels the Nyberg's accumulator.</description><identifier>ISSN: 0916-8532</identifier><identifier>EISSN: 1745-1361</identifier><identifier>DOI: 10.1093/ietisy/e91-d.5.1489</identifier><language>eng</language><publisher>The Institute of Electronics, Information and Communication Engineers</publisher><subject>accumulated hash function ; Accumulators ; Combinatorial analysis ; Cryptography ; Decentralized ; Digital signatures ; Hash based algorithms ; Mathematical analysis ; Mathematical models ; one-way accumulator</subject><ispartof>IEICE Transactions on Information and Systems, 2008/05/01, Vol.E91.D(5), pp.1489-1491</ispartof><rights>2008 The Institute of Electronics, Information and Communication Engineers</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c561t-eedd817ca122de0e9400ef20ae3b5056a617262dfb86afa47335c71f6e830aad3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,1877,4010,27902,27903,27904</link.rule.ids></links><search><creatorcontrib>YUM, Dae Hyun</creatorcontrib><creatorcontrib>SEO, Jae Woo</creatorcontrib><creatorcontrib>LEE, Pil Joong</creatorcontrib><title>Generalized Combinatoric Accumulator</title><title>IEICE Transactions on Information and Systems</title><addtitle>IEICE Trans. Inf. &amp; Syst.</addtitle><description>The accumulator was introduced as a decentralized alternative to digital signatures. While most of accumulators are based on number theoretic assumptions and require time-consuming modulo exponentiations, Nyberg's combinatoric accumulator dose not depend on any computational assumption and requires only bit operations and hash function evaluations. In this article, we present a generalization of Nyberg's combinatoric accumulator, which allows a lower false positive rate with the same output length. Our generalization also shows that the Bloom filter can be used as a cryptographic accumulator and moreover excels the Nyberg's accumulator.</description><subject>accumulated hash function</subject><subject>Accumulators</subject><subject>Combinatorial analysis</subject><subject>Cryptography</subject><subject>Decentralized</subject><subject>Digital signatures</subject><subject>Hash based algorithms</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>one-way accumulator</subject><issn>0916-8532</issn><issn>1745-1361</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNo9kD9PwzAQRy0EEqXwCVg6IDGl9cWxk4xVKQVRiQVm62pfwFX-FDsZyqdvokCnn05674bH2D3wOfBcLBy1LhwXlENk53IOSZZfsAmkiYxAKLhkE56DijIp4mt2E8Kec8hikBP2sKGaPJbul-xs1VQ7V2PbeGdmS2O6qiuH65ZdFVgGuvvbKft8Xn-sXqLt--Z1tdxGRipoIyJrM0gNQhxb4pQnnFMRcySxk1wqVJDGKrbFLlNYYJIKIU0KhaJMcEQrpuxx_HvwzU9HodWVC4bKEmtquqAzlSQ8ydO0J8VIGt-E4KnQB-8q9EcNXA9J9JhE90m01VIPSXrrbbT2ocUvOjvoW2dK0q3HOri60Oveeuqt_x3sM2W-0WuqxQl9DnI4</recordid><startdate>2008</startdate><enddate>2008</enddate><creator>YUM, Dae Hyun</creator><creator>SEO, Jae Woo</creator><creator>LEE, Pil Joong</creator><general>The Institute of Electronics, Information and Communication Engineers</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2008</creationdate><title>Generalized Combinatoric Accumulator</title><author>YUM, Dae Hyun ; SEO, Jae Woo ; LEE, Pil Joong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c561t-eedd817ca122de0e9400ef20ae3b5056a617262dfb86afa47335c71f6e830aad3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>accumulated hash function</topic><topic>Accumulators</topic><topic>Combinatorial analysis</topic><topic>Cryptography</topic><topic>Decentralized</topic><topic>Digital signatures</topic><topic>Hash based algorithms</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>one-way accumulator</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>YUM, Dae Hyun</creatorcontrib><creatorcontrib>SEO, Jae Woo</creatorcontrib><creatorcontrib>LEE, Pil Joong</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEICE Transactions on Information and Systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>YUM, Dae Hyun</au><au>SEO, Jae Woo</au><au>LEE, Pil Joong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Generalized Combinatoric Accumulator</atitle><jtitle>IEICE Transactions on Information and Systems</jtitle><addtitle>IEICE Trans. Inf. &amp; Syst.</addtitle><date>2008</date><risdate>2008</risdate><volume>E91.D</volume><issue>5</issue><spage>1489</spage><epage>1491</epage><pages>1489-1491</pages><issn>0916-8532</issn><eissn>1745-1361</eissn><abstract>The accumulator was introduced as a decentralized alternative to digital signatures. While most of accumulators are based on number theoretic assumptions and require time-consuming modulo exponentiations, Nyberg's combinatoric accumulator dose not depend on any computational assumption and requires only bit operations and hash function evaluations. In this article, we present a generalization of Nyberg's combinatoric accumulator, which allows a lower false positive rate with the same output length. Our generalization also shows that the Bloom filter can be used as a cryptographic accumulator and moreover excels the Nyberg's accumulator.</abstract><pub>The Institute of Electronics, Information and Communication Engineers</pub><doi>10.1093/ietisy/e91-d.5.1489</doi><tpages>3</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0916-8532
ispartof IEICE Transactions on Information and Systems, 2008/05/01, Vol.E91.D(5), pp.1489-1491
issn 0916-8532
1745-1361
language eng
recordid cdi_proquest_miscellaneous_864404977
source J-STAGE Free; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects accumulated hash function
Accumulators
Combinatorial analysis
Cryptography
Decentralized
Digital signatures
Hash based algorithms
Mathematical analysis
Mathematical models
one-way accumulator
title Generalized Combinatoric Accumulator
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T07%3A13%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Generalized%20Combinatoric%20Accumulator&rft.jtitle=IEICE%20Transactions%20on%20Information%20and%20Systems&rft.au=YUM,%20Dae%20Hyun&rft.date=2008&rft.volume=E91.D&rft.issue=5&rft.spage=1489&rft.epage=1491&rft.pages=1489-1491&rft.issn=0916-8532&rft.eissn=1745-1361&rft_id=info:doi/10.1093/ietisy/e91-d.5.1489&rft_dat=%3Cproquest_cross%3E864404977%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=864404977&rft_id=info:pmid/&rfr_iscdi=true