Generalized Combinatoric Accumulator
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E91-D No.5 pp.1489-1491
- Publication Date
- 2008/05/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1093/ietisy/e91-d.5.1489
- Type of Manuscript
- Special Section LETTER (Special Section on Information and Communication System Security)
- Category
- Cryptographic Techniques
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Dae Hyun YUM, Jae Woo SEO, Pil Joong LEE, "Generalized Combinatoric Accumulator" in IEICE TRANSACTIONS on Information,
vol. E91-D, no. 5, pp. 1489-1491, May 2008, doi: 10.1093/ietisy/e91-d.5.1489.
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.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.5.1489/_p
Copy
@ARTICLE{e91-d_5_1489,
author={Dae Hyun YUM, Jae Woo SEO, Pil Joong LEE, },
journal={IEICE TRANSACTIONS on Information},
title={Generalized Combinatoric Accumulator},
year={2008},
volume={E91-D},
number={5},
pages={1489-1491},
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.},
keywords={},
doi={10.1093/ietisy/e91-d.5.1489},
ISSN={1745-1361},
month={May},}
Copy
TY - JOUR
TI - Generalized Combinatoric Accumulator
T2 - IEICE TRANSACTIONS on Information
SP - 1489
EP - 1491
AU - Dae Hyun YUM
AU - Jae Woo SEO
AU - Pil Joong LEE
PY - 2008
DO - 10.1093/ietisy/e91-d.5.1489
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E91-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2008
AB - 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.
ER -
English
