Corpus ID: 17641671

Eecient Accumulators without Trapdoor Extended Abstract

  title={Eecient Accumulators without Trapdoor Extended Abstract},
  author={Tomas Sander},
In 1994 Benaloh and de Mare introduced the notion of one way accumulators that allow to construct eecient protocols for proving membership in a list and related problems like time stamping and authentication. As required by Benaloh et al. unlike in signature based protocols no central trusted authority is (should be) needed. Accumula-tor based protocols do further improve on hash tree based protocols for proving membership in a list as veriication and storage requirements are independent of the… Expand
Authenticated Hash Tables Based on Cryptographic Accumulators
This work addresses the problem of authenticating the hash table operations, where the goal is to design protocols capable of verifying the correctness of queries and updates performed by the server, thus ensuring the integrity of the remotely stored data across its entire update history. Expand
Cryptographic Accumulators for Authenticated Hash Tables
This work provides the first construction for authenticating a hash table with constant query cost and sublinear update cost, strictly improving upon previous methods, and designs efficient and secure protocols for optimally authenticating (non-membership queries on hash tables. Expand
Efficient verifiable delay functions
This work constructs a verifiable delay function (VDF) based on groups of unknown order such as an RSA group, or the class group of an imaginary quadratic field, which is very short, and the verification of correctness is very efficient. Expand
Efficient Verifiable Delay Functions (extended version)
We construct a verifiable delay function (VDF). A VDF is a function whose evaluation requires running a given number of sequential steps, yet the result can be efficiently verified. They haveExpand
Trustless unknown-order groups
Groups forwhich it is computationally difficult to compute the order have important applications including time-lock puzzles, verifiable delay functions, and accumulators. In some scenarios it isExpand
Blind, Auditable Membership Proofs
This work defines the primitive of "blind auditable membership proof" (BAMP) which combines public auditability with privacy (i.e. user anonymity) and shows that BAMP can be implemented quite efficiently (namely, without resorting to general zero-knowledge proofs of NP statements). Expand
Authenticated hash tables
This is the first construction for authenticating a hash table with a constant query cost and sublinear update cost, and employs the RSA accumulator in a nested way over the stored data, strictly improving upon previous accumulator-based solutions. Expand
CATS : Certified Authenticated Tamper-evident State Store for Network Services
This paper presents the design, implementation, and evaluation of CATS, a toolkit for indexed state storage for network services. CATS is based on a new implementation of a persistent authenticatedExpand
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
Zerocoin is proposed, a cryptographic extension to Bitcoin that augments the protocol to allow for fully anonymous currency transactions and uses standard cryptographic assumptions and does not introduce new trusted parties or otherwise change the security model of Bitcoin. Expand


Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
The definition of accumulators is generalized and a collision-free subtype is defined and a fail-stop signature scheme in which many one-time public keys are accumulated into one short public key is constructed. Expand
One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract)
A simple candidate one-way hash function which satisfies a quasi-commutative property that allows it to be used as an accumulator is described, which allows protocols to be developed in which the need for a trusted central authority can be eliminated. Expand
Auditable, anonymous electronic cash
This paper builds a fully anonymous, auditable system, by constructing an electronic cash system that is signature-free, and where the bank needs to have no secret at all, and is the first to do so without the necessity of making individual transactions potentially traceable. Expand
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
This paper proposes a bit commitment scheme, BC(·), and efficient statistical zero knowledge (in short, SZK) protocols in which, for any given multi-variable polynomial f(X 1,..,X t) and any givenExpand
A Group Signature Scheme with Improved Efficiency
This paper proposes a new group signature scheme that is well suited for large groups, i.e., the length of the group’s public key and of signatures do not depend on the size of the groups. Expand
On blind signatures and perfect crimes
A problematic aspect of blind signatures is discussed, showing that this perfect solution to protect the identity and privacy of a user can potentially lead to perfect crime. Expand
On the generation of cryptographically strong pseudorandom sequences
In this paper we show how to generate from a short random seed S a long sequence of pseudo-random numbers Ri in which the problem of computing one more Ri value given an arbitrarily large subset ofExpand
Fast Accumulated Hashing
A new non-trapdoor accumulator for cumulative hashing is introduced. It can be efficiently realized in practise using existing cryptographic hash algorithms and pseudorandom sequence generators. TheExpand
Protocols for Public Key Cryptosystems
  • R. Merkle
  • Computer Science
  • 1980 IEEE Symposium on Security and Privacy
  • 1980
Several protocols for public key distribution and for digital signatures are briefly compared with each other and with the conventional alternative. Expand
An Introduction to the Theory of Numbers
This is the fifth edition of a work (first published in 1938) which has become the standard introduction to the subject. The book has grown out of lectures delivered by the authors at Oxford,Expand