Topics in Cryptology – CT-RSA 2005

From MaRDI portal
Publication:5710837

DOI10.1007/b105222zbMath1079.94568OpenAlexW2476332689MaRDI 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




Related Items (48)

Cryptanalysis of a dynamic universal accumulator over bilinear groupsMulti-party revocation in sovrin: performance through distributed trustUC Updatable Databases and ApplicationsZero-knowledge proofs for set membership: efficient, succinct, modularOne-time traceable ring signaturesA New Approach to Efficient Revocable Attribute-Based Anonymous CredentialsIdentity based linkable ring signature with logarithmic sizeDynamic universal accumulator with batch update over bilinear groupsCertificateless ring signature based on RSA problem and DL problemImproved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence ClassesLattice-Based Group Encryption with Full Dynamicity and Message Filtering PolicyZero-Knowledge Accumulators and Set AlgebraIntegrity Preserving Multi-keyword Searchable Encryption for Cloud ComputingAn Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured ChannelsA Provably Secure Ring Signature Scheme in Certificateless CryptographyTraceable Identity-Based Group SignatureZero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoorsLogarithmic-size (linkable) threshold ring signatures in the plain modelEfficient adaptively-secure Byzantine agreement for long messagesEfficient code-based fully dynamic group signature schemeMoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential systemKVaC: key-value commitments for blockchains and beyondNon-malleable vector commitments via local equivocabilityFoundations of fully dynamic group signaturesTwo new identity-based threshold ring signature schemesVector Commitments and Their ApplicationsEfficient authenticated data structures for graph connectivity and geometric search problemsA Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract)Zero-knowledge proofs for set membership: efficient, succinct, modularMulti-Identity Single-Key Decryption without Random OraclesCryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05Certificate-free \textit{ad hoc} anonymous authenticationNon-malleable vector commitments via local equivocabilityCertificateless threshold ring signatureMutative Identity-Based Signatures or Dynamic Credentials Without Random OraclesDynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential SystemsTowards Lightweight Anonymous Entity Authentication for IoT ApplicationsEfficient redactable signature and application to anonymous credentialsFoundations of Fully Dynamic Group SignaturesEfficient Asynchronous Accumulators for Distributed PKIBounded Size-Hiding Private Set IntersectionUC Commitments for Modular Protocol Design and Applications to Revocation and Attribute TokensEfficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving CredentialsLattice-based group signatures: achieving full dynamicity (and deniability) with easeA symmetric cryptographic scheme for data integrity verification in cloud databasesAn \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked usersNew constructions of hinting PRGs, OWFs with encryption, and moreAuthenticated hash tables based on cryptographic accumulators




This page was built for publication: Topics in Cryptology – CT-RSA 2005