Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Identifieur interne : 002492 ( Main/Curation ); précédent : 002491; suivant : 002493Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Auteurs : Niko Bari [Allemagne] ; Birgit Pfitzmann [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1997.
Abstract
Abstract: One-way accumulators, introduced by Benaloh and de Mare, can be used to accumulate a large number of values into a single one, which can then be used to authenticate every input value without the need to transmit the others. However, the one-way property does is not sufficient for all applications. In this paper, we generalize the definition of accumulators and define and construct a collision-free subtype. As an application, we construct a fail-stop signature scheme in which many one-time public keys are accumulated into one short public key. In contrast to previous constructions with tree authentication, the length of both this public key and the signatures can be independent of the number of messages that can be signed.
Url:
DOI: 10.1007/3-540-69053-0_33
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001305
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :001193
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000F64
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :002927
Links to Exploration step
ISTEX:A170198BB1552615952423D5CD7AB2F5328684A9Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees</title><author><name sortKey="Bari, Niko" sort="Bari, Niko" uniqKey="Bari N" first="Niko" last="Bari">Niko Bari</name></author><author><name sortKey="Pfitzmann, Birgit" sort="Pfitzmann, Birgit" uniqKey="Pfitzmann B" first="Birgit" last="Pfitzmann">Birgit Pfitzmann</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A170198BB1552615952423D5CD7AB2F5328684A9</idno><date when="1997" year="1997">1997</date><idno type="doi">10.1007/3-540-69053-0_33</idno><idno type="url">https://api.istex.fr/document/A170198BB1552615952423D5CD7AB2F5328684A9/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001305</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001305</idno><idno type="wicri:Area/Istex/Curation">001193</idno><idno type="wicri:Area/Istex/Checkpoint">000F64</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000F64</idno><idno type="wicri:doubleKey">0302-9743:1997:Bari N:collision:free:accumulators</idno><idno type="wicri:Area/Main/Merge">002927</idno><idno type="wicri:Area/Main/Curation">002492</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees</title><author><name sortKey="Bari, Niko" sort="Bari, Niko" uniqKey="Bari N" first="Niko" last="Bari">Niko Bari</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>dvg Hannover, Postfach 91 02 40, D-30422, Hannover</wicri:regionArea><placeName><region type="land" nuts="2">Basse-Saxe</region><settlement type="city">Hanovre</settlement></placeName></affiliation></author><author><name sortKey="Pfitzmann, Birgit" sort="Pfitzmann, Birgit" uniqKey="Pfitzmann B" first="Birgit" last="Pfitzmann">Birgit Pfitzmann</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Universität Dortmund, Informatik 6, D-44221, Dortmund</wicri:regionArea><placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region><region type="district" nuts="2">District d'Arnsberg</region><settlement type="city">Dortmund</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1997</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">A170198BB1552615952423D5CD7AB2F5328684A9</idno><idno type="DOI">10.1007/3-540-69053-0_33</idno><idno type="ChapterID">33</idno><idno type="ChapterID">Chap33</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: One-way accumulators, introduced by Benaloh and de Mare, can be used to accumulate a large number of values into a single one, which can then be used to authenticate every input value without the need to transmit the others. However, the one-way property does is not sufficient for all applications. In this paper, we generalize the definition of accumulators and define and construct a collision-free subtype. As an application, we construct a fail-stop signature scheme in which many one-time public keys are accumulated into one short public key. In contrast to previous constructions with tree authentication, the length of both this public key and the signatures can be independent of the number of messages that can be signed.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002492 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 002492 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Curation
|type= RBID
|clé= ISTEX:A170198BB1552615952423D5CD7AB2F5328684A9
|texte= Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
}}
| This area was generated with Dilib version V0.6.31. |  |