scientific article; zbMATH DE number 1394309
From MaRDI portal
Publication:4934724
Recommendations
Cited in
(78)- Non-interactive timestamping in the bounded-storage model
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
- How to sign digital streams
- Group encryption: full dynamicity, message filtering and code-based instantiation
- New constructions of hinting PRGs, OWFs with encryption, and more
- New code-based cryptographic accumulator and fully dynamic group signature
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Stronger notions and a more efficient construction of threshold ring signatures
- Dynamic universal accumulator with batch update over bilinear groups
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Decentralized policy-hiding ABE with receiver privacy
- New methods and abstractions for RSA-based forward secure signatures
- Authenticated hash tables based on cryptographic accumulators
- Merkle trees optimized for stateless clients in bitcoin
- 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
- Secure application execution in mobile devices
- Efficient Asynchronous Accumulators for Distributed PKI
- Zero-Knowledge Accumulators and Set Algebra
- Database outsourcing with hierarchical authenticated data structures
- New generation of secure and practical RSA-based signatures
- A new approach to efficient revocable attribute-based anonymous credentials
- An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels
- Unclonable Group Identification
- Multi-Identity Single-Key Decryption without Random Oracles
- Statistically Hiding Sets
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- scientific article; zbMATH DE number 1064637 (Why is no real title available?)
- Fast accumulated hashing
- Vector commitments and their applications
- scientific article; zbMATH DE number 1424194 (Why is no real title available?)
- UC Updatable Databases and Applications
- An everlasting secure non-interactive timestamping scheme in the bounded storage model
- Mutative Identity-Based Signatures or Dynamic Credentials Without Random Oracles
- Super-Efficient Verification of Dynamic Outsourced Databases
- Efficient authenticated data structures for graph connectivity and geometric search problems
- scientific article; zbMATH DE number 7656025 (Why is no real title available?)
- 2D hash chain robust random key distribution scheme
- Non-malleable vector commitments via local equivocability
- Lattice-based accumulator with constant time list update and constant time verification
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Functional commitments for all functions, with transparent setup and from SIS
- Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice
- 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?
- Short concurrent covert authenticated key exchange (short cAKE)
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Resource fairness and composability of cryptographic protocols
- Limits on revocable proof systems, with implications for stateless blockchains
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Zero-knowledge functional elementary databases
- Set (non-)membership NIZKs from determinantal accumulators
- Oblivious accumulators
- Asymptotically optimal message dissemination with applications to blockchains
- Universal vector commitments
- COMPASS: a compact PASS-lineage accumulator with succinct proofs
- Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
- DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions
- An efficient conditionally anonymous ring signature in the random oracle model
- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- Proactive refresh for accountable threshold signatures
- Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs
- On the impossibility of actively secure distributed samplers
- Lower bounding update frequency in short accumulators and vector commitments
- Structure-preserving compressing primitives: vector commitments and accumulators and applications
- Lattice-based accumulator and application to anonymous credential revocation
- Tight lower bound on witness update frequency in additive positive accumulators
- A symmetric cryptographic scheme for data integrity verification in cloud databases
- Cryptanalysis of a dynamic universal accumulator over bilinear groups
- Multi-party revocation in sovrin: performance through distributed trust
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934724)
