scientific article

Publication date: 21 March 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2045/20450093

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

privacy protection blind signatures e-cash circular encryption credential system key-oblivious encryption pseudonym system

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (92)

Group Signatures with Decentralized Tracing ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Private authentication ⋮ Policy-based signature scheme from lattices ⋮ Anonymous Authentication with Optional Shared Anonymity Revocation and Linkability ⋮ The KDM-CCA Security of REACT ⋮ Garbling XOR gates ``for free in the standard model ⋮ A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials ⋮ Issuer-hiding attribute-based credentials ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Anonymous, robust post-quantum public key encryption ⋮ Anonymity of NIST PQC round 3 KEMs ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Signatures and Efficient Proofs on Committed Graphs and NP-Statements ⋮ Anonymous tokens with public metadata and applications to private contact tracing ⋮ Privacy-preserving blueprints ⋮ Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones ⋮ Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model ⋮ PAPR: publicly auditable privacy revocation for anonymous credentials ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity ⋮ Unidirectional updatable encryption and proxy re-encryption from DDH ⋮ Post-quantum anonymity of Kyber ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ Two faces of blindness ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ An Open Mobile Identity Tool: An Architecture for Mobile Identity Management ⋮ NIWI and new notions of extraction for algebraic languages ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ Anonymous tokens with stronger metadata bit hiding from algebraic MACs ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist ⋮ Key-oblivious encryption from isogenies with application to accountable tracing signatures ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Improved algebraic MACs and practical keyed-verification anonymous credentials ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system ⋮ Updatable public key encryption in the standard model ⋮ Policy-compliant signatures ⋮ Efficient oblivious transfers with access control ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Group Encryption ⋮ Breaking and Fixing Anonymous Credentials for the Cloud ⋮ Decentralized Attribute-Based Signatures ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract) ⋮ OAEP Is Secure under Key-Dependent Messages ⋮ Fair Traceable Multi-Group Signatures ⋮ Completeness of Single-Bit Projection-KDM Security for Public Key Encryption ⋮ Recovering Lost Device-Bound Credentials ⋮ Towards Key-Dependent Message Security in the Standard Model ⋮ Formal Treatment of Privacy-Enhancing Credential Systems ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems ⋮ Key-dependent message security: generic amplification and completeness ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ Towards Lightweight Anonymous Entity Authentication for IoT Applications ⋮ Security under message-derived keys: signcryption in iMessage ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems ⋮ Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing ⋮ Group signatures with user-controlled and sequential linkability ⋮ Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks ⋮ Master-key KDM-secure ABE via predicate encoding ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Bounded KDM Security from iO and OWF ⋮ Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE ⋮ Circular Security Separations for Arbitrary Length Cycles from LWE ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes ⋮ An Efficient Self-blindable Attribute-Based Credential Scheme ⋮ Survey of Lattice-Based Group Signature ⋮ Anonymous tokens with private metadata bit ⋮ Lattice-based blind signatures, revisited ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model

This page was built for publication: