Collection and destruction of old accumulators
نویسندگان
چکیده
منابع مشابه
Accumulators and U-Prove Revocation
This work introduces the most efficient universal accumulator known today. For the first time, we have an accumulator which does not depend on hidden order groups, does not require any exponentiations in the target group associated with the pairing function, and only requires two pairings to verify a proof-of-knowledge of a witness. We present implementations of our accumulator and another rece...
متن کاملAccumulators in Context 1 Running head : ACCUMULATORS IN CONTEXT
An integrated theory of context effects in memory retrieval is introduced. The theory, called Retrieval by ACcumulating Evidence in an Architecture (RACE/A), integrates ideas from accumulator models in the cognitive architecture ACT-R. This new theory explains how a particular retrieval from declarative memory is influenced by concurrent cognitive processes. RACE/A accounts for memory interfere...
متن کاملنقد و بررسی کتاب the collection of the quran
جان برتن استاد بازنشسته دانشگاه سنتاندروز، مولف کتاب جمعآوری قرآن است. این اثر در سال 1977 توسط انتشارات دانشگاه کمبریج به چاپ رسید. در نگاه اول، اثر مذکور مشتمل بر دو بخش و هر بخش دارای پنج فصل است. مولف در بخش اول به مسأله نسخ میپردازد و در مورد این که آیا قرآن سنت را نسخ کرده و یا بالعکس، به تفصیل سخن میگوید. نظرات شافعی و مخالفانش را در اینباره به طور مشروح بیان میکند. وی سه شکل ن...
15 صفحه اولCryptographic Accumulators: Definitions, Constructions and Applications
After their first appearance in the cryptographic community ten years ago, cryptographic accumulators have received a discontinuous attention from the researchers of the field. Although occasionally studied, there has been no systematic effort to organize the knowledge of the subject, abstracting away from the unnecessary details of specific proposals, so as to provide a reliable starting point...
متن کاملZero-Knowledge Accumulators and Set Operations
Accumulators provide a way to succinctly represent a set with elements drawn from a given domain, using an accumulation value. Subsequently, short proofs for the set-membership (or non-membership) of any element from the domain can be constructed and efficiently verified with respect to this accumulation value. Accumulators have been widely studied in the literature, primarily, as an authentica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linnaeus Eco-Tech
سال: 2019
ISSN: 2002-8008
DOI: 10.15626/eco-tech.1997.033