One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
One-way accumulators were proposed by Benaloh and Mare and are based on the RSA assumption.
“One-way accumulators were proposed by Benaloh and Mare [11] and are based on RSA assumption [34].”
From IoT Expunge: Implementing Verifiable Retention of IoT Data (2020) · cites this paper as [11]
All sensor readings belonging to the same epoch are allocated a single cryptographic timestamp generated using a one-way accumulator.
“All the sensor readings that belong to the same epoch are allocated a single cryptographic timestamp, which is generated using the one-way accumulator [11].”
From IoT Expunge: Implementing Verifiable Retention of IoT Data (2020) · cites this paper as [11]
The paper provides a mechanism for allocating cryptographically verifiable timestamps to sensor records based on one-way accumulators.
“Amechanism for allocating cryptographically verifiable timestamp (§5.1) to sensor records based on one-way accumulators [11].”
From IoT Expunge: Implementing Verifiable Retention of IoT Data (2020) · cites this paper as [11]
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
Miers, I., Garman, C., Green, M., & Rubin, A. D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.34 · Cited by 983 · see citing works
Security services using blockchains: a state of the art survey
Salman, T., Zolanvari, M., Erbad, A., Jain, R., & Samaka, M. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2863956 · Cited by 502 · see citing works
Optimally Efficient Accountable Time-Stamping
Buldas, A., Lipmaa, H., & Schoenmakers, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-46588-1_20 · Cited by 53 · see citing works
IoT Expunge: Implementing Verifiable Retention of IoT Data
Panwar, N., Sharma, S., Gupta, P., Ghosh, D., Mehrotra, S., & Venkatasubramanian, N. (2020) · Proceedings of the Tenth ACM Conference on Data and Application Security and Privacy · doi:10.1145/3374664.3375737 · Cited by 6 · see citing works
“e 2: Time allocation (Lines 2-6 of Algorithm 1). All the sensor readings that belong to the same epoch are allocated a single cryptographic timestamp, which is generated using the one-way accumulator [11]. In the following, we explain the steps in detail: Step 1: Initialization. Initially, a seed value x is generated…”
BackgroundMethodInfluential
- Authors
- Benaloh, J., & de Mare, M.
- Affiliations
- Clarkson University (US)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1994
- Pages
- 274-285
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1784881995
- Cited by
- 572
- References
- 1
- Citations by year
- 2026: 21 · 2025: 27 · 2024: 40 · 2023: 27 · 2022: 25 · 2021: 26 · 2020: 32 · 2019: 20 · 2018: 32 · 2017: 19 · 2016: 20 · 2015: 26 · 2014: 23 · 2013: 30 · 2012: 23
- FWCI
- 2.06
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Keywords
- one-way hash function, decentralized protocols, digital signatures, membership testing, distributed protocols
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
