Authenticated hash tables based on cryptographic accumulators (Q262258): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SNARKs for C / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PBC Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Pinocchio / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NTL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-014-9968-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127155618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Fourier Transforms Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Perfect Hashing: Upper and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking the correctness of memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short signatures without random oracles and the SDH assumption in bilinear groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifiable Set Operations over Outsourced Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Efficient Can Memory Checking Be? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general model for authenticated data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Hash-and-Sign Signatures Without the Random Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-Efficient Verification of Dynamic Outsourced Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient authenticated data structures for graph connectivity and geometric search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum queue size and hashing with lazy deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Accumulators with Efficient Nonmembership Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Cryptology – CT-RSA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data and Applications Security XIX / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design of dynamic data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Authenticated Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated hash tables based on cryptographic accumulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Verification of Operations on Dynamic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Content Authentication in Peer-to-Peer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Authenticated Data Structures with Multilinear Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Dynamic Accumulator for Batch Updates / rank
 
Normal rank

Latest revision as of 16:08, 11 July 2024

scientific article
Language Label Description Also known as
English
Authenticated hash tables based on cryptographic accumulators
scientific article

    Statements

    Authenticated hash tables based on cryptographic accumulators (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2016
    0 references
    authenticated data structures
    0 references
    cryptographic accumulators
    0 references
    cloud computing security
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers