Topics in Cryptology – CT-RSA 2005

From MaRDI portal
Publication:5710837


DOI10.1007/b105222zbMath1079.94568MaRDI QIDQ5710837

No author found.

Publication date: 8 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105222


94A60: Cryptography


Related Items

Vector Commitments and Their Applications, A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract), UC Updatable Databases and Applications, Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes, Mutative Identity-Based Signatures or Dynamic Credentials Without Random Oracles, Zero-knowledge proofs for set membership: efficient, succinct, modular, Non-malleable vector commitments via local equivocability, Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy, Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors, Logarithmic-size (linkable) threshold ring signatures in the plain model, Efficient adaptively-secure Byzantine agreement for long messages, Efficient code-based fully dynamic group signature scheme, Authenticated hash tables based on cryptographic accumulators, Efficient authenticated data structures for graph connectivity and geometric search problems, Certificate-free \textit{ad hoc} anonymous authentication, Certificateless threshold ring signature, 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, Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05, Efficient redactable signature and application to anonymous credentials, New constructions of hinting PRGs, OWFs with encryption, and more, Zero-knowledge proofs for set membership: efficient, succinct, modular, One-time traceable ring signatures, Identity based linkable ring signature with logarithmic size, Dynamic universal accumulator with batch update over bilinear groups, Foundations of fully dynamic group signatures, Lattice-based group signatures: achieving full dynamicity (and deniability) with ease, An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users, Two new identity-based threshold ring signature schemes, MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system, KVaC: key-value commitments for blockchains and beyond, Non-malleable vector commitments via local equivocability, Towards Lightweight Anonymous Entity Authentication for IoT Applications, Foundations of Fully Dynamic Group Signatures, Efficient Asynchronous Accumulators for Distributed PKI, Bounded Size-Hiding Private Set Intersection, UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens, Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials, Zero-Knowledge Accumulators and Set Algebra, Integrity Preserving Multi-keyword Searchable Encryption for Cloud Computing, Traceable Identity-Based Group Signature, Certificateless ring signature based on RSA problem and DL problem, A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials, An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels, A Provably Secure Ring Signature Scheme in Certificateless Cryptography, Multi-Identity Single-Key Decryption without Random Oracles, Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems