scientific article; zbMATH DE number 1394309
From MaRDI portal
Publication:4934724
zbMath0951.94532MaRDI QIDQ4934724
Publication date: 31 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cryptanalysis of a dynamic universal accumulator over bilinear groups ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ UC Updatable Databases and Applications ⋮ Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications ⋮ Compressing proofs of \(k\)-out-of-\(n\) partial knowledge ⋮ New Generation of Secure and Practical RSA-Based Signatures ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Stronger notions and a more efficient construction of threshold ring signatures ⋮ A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials ⋮ Dynamic universal accumulator with batch update over bilinear groups ⋮ Database Outsourcing with Hierarchical Authenticated Data Structures ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ Decentralized policy-hiding ABE with receiver privacy ⋮ Merkle trees optimized for stateless clients in bitcoin ⋮ Lattice-based accumulator with constant time list update and constant time verification ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice ⋮ An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Lower bounds for the number of decryption updates in registration-based encryption ⋮ Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? ⋮ Unnamed Item ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ KVaC: key-value commitments for blockchains and beyond ⋮ Incrementally aggregatable vector commitments and applications to verifiable decentralized storage ⋮ On the (Ir)replaceability of global setups, or how (not) to use a global ledger ⋮ Non-malleable vector commitments via local equivocability ⋮ Vector and functional commitments from lattices ⋮ Efficient attribute-based signature for monotone predicates ⋮ Resource fairness and composability of cryptographic protocols ⋮ New methods and abstractions for RSA-based forward secure signatures ⋮ Vector Commitments and Their Applications ⋮ An efficient conditionally anonymous ring signature in the random oracle model ⋮ Efficient authenticated data structures for graph connectivity and geometric search problems ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Unclonable Group Identification ⋮ Multi-Identity Single-Key Decryption without Random Oracles ⋮ Non-malleable vector commitments via local equivocability ⋮ 2D hash chain robust random key distribution scheme ⋮ Secure Application Execution in Mobile Devices ⋮ Mutative Identity-Based Signatures or Dynamic Credentials Without Random Oracles ⋮ Super-Efficient Verification of Dynamic Outsourced Databases ⋮ Statistically Hiding Sets ⋮ Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Efficient Asynchronous Accumulators for Distributed PKI ⋮ A symmetric cryptographic scheme for data integrity verification in cloud databases ⋮ New constructions of hinting PRGs, OWFs with encryption, and more ⋮ New code-based cryptographic accumulator and fully dynamic group signature ⋮ How to sign digital streams ⋮ An Everlasting Secure Non-interactive Timestamping Scheme in the Bounded Storage Model ⋮ Authenticated hash tables based on cryptographic accumulators
