Advances in Cryptology – CRYPTO 2004

DOI10.1007/B99099zbMath1104.94044DBLPconf/crypto/2004OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311552

Hovav Shacham, Xavier Boyen, Dan Boneh

Publication date: 23 August 2005

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

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Related Items (only showing first 100 items - show all)

Short Attribute-Based Signatures for Threshold Predicates ⋮ Plaintext-Checkable Encryption ⋮ Witness Maps and Applications ⋮ Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ Ambiguous One-Move Nominative Signature Without Random Oracles ⋮ IBE Under $$k$$-LIN with Shorter Ciphertexts and Private Keys ⋮ Generic Transformation to Strongly Existentially Unforgeable Signature Schemes with Continuous Leakage Resiliency ⋮ Constant Size Ring Signature Without Random Oracle ⋮ Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability ⋮ A Dynamic Attribute-Based Authentication Scheme ⋮ Anonymous Data Collection System with Mediators ⋮ Fully adaptive decentralized multi-authority \textsf{ABE} ⋮ Private polynomial commitments and applications to MPC ⋮ Tracing a linear subspace: application to linearly-homomorphic group signatures ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ A Shuffle Argument Secure in the Generic Model ⋮ An Efficient and Expressive Ciphertext-Policy Attribute-Based Encryption Scheme with Partially Hidden Access Structures ⋮ Revisiting BBS signatures ⋮ A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Traceable Identity-Based Group Signature ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Anonymous yet Traceable Strong Designated Verifier Signature ⋮ Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions ⋮ Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience ⋮ Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions ⋮ A Black-Box Construction of Strongly Unforgeable Signature Scheme in the Leakage Setting ⋮ Expanded Framework for Dual System Encryption and Its Application ⋮ Privacy Preserving Data Mining within Anonymous Credential Systems ⋮ A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort ⋮ Fully Anonymous Group Signatures Without Random Oracles ⋮ Group Encryption ⋮ PAChain: Private, Authenticated and Auditable Consortium Blockchain ⋮ Defending against Key Abuse Attacks in KP-ABE Enabled Broadcast Systems ⋮ Self-organized Anonymous Authentication in Mobile Ad Hoc Networks ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Tagged One-Time Signatures: Tight Security and Optimal Tag Size ⋮ Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ Verifiable Elections That Scale for Free ⋮ Algebraic curves and cryptography ⋮ Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs ⋮ CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions ⋮ Scalable Multi-party Private Set-Intersection ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Non-malleable Codes with Split-State Refresh ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ A New Dynamic Code-Based Group Signature Scheme ⋮ Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm ⋮ An Anonymous Designated Verifier Signature Scheme with Revocation: How to Protect a Company’s Reputation ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Security Analysis of the Strong Diffie-Hellman Problem ⋮ Compact Group Signatures Without Random Oracles ⋮ Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys ⋮ Unlinkable Randomizable Signature and Its Application in Group Signature ⋮ Ambiguous Optimistic Fair Exchange ⋮ Universally Composable Adaptive Oblivious Transfer ⋮ Pairings in Trusted Computing ⋮ Homomorphic Encryption and Signatures from Vector Decomposition ⋮ Hidden-Vector Encryption with Groups of Prime Order ⋮ No-signaling linear PCPs ⋮ Continuously non-malleable codes with split-state refresh ⋮ No-signaling linear PCPs ⋮ Discrete logarithm problems with auxiliary inputs ⋮ Non-interactive Confirmer Signatures ⋮ Attribute-Based Signatures ⋮ Universally Anonymous IBE Based on the Quadratic Residuosity Assumption ⋮ Key-Private Proxy Re-encryption ⋮ Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems ⋮ Practical Short Signature Batch Verification ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Deterministic Public-Key Encryption Under Continual Leakage ⋮ Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy ⋮ Secure Obfuscation of Encrypted Verifiable Encrypted Signatures ⋮ Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures ⋮ Forward-Secure Group Signatures from Pairings ⋮ Efficient Traceable Signatures in the Standard Model ⋮ Universally Composable Adaptive Priced Oblivious Transfer ⋮ Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys ⋮ Towards Restricting Plaintext Space in Public Key Encryption ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming ⋮ Privacy-Aware Attribute-Based Encryption with User Accountability ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes ⋮ Designated Confirmer Signatures with Unified Verification ⋮ Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem ⋮ Digital Signatures ⋮ An Efficient Self-blindable Attribute-Based Credential Scheme ⋮ Cryptographic Voting — A Gentle Introduction ⋮ Survey of Lattice-Based Group Signature ⋮ Adequate Elliptic Curves for Computing the Product of n Pairings ⋮ A Practical Group Signature Scheme Based on Rank Metric ⋮ A scalable post-quantum hash-based group signature

This page was built for publication: Advances in Cryptology – CRYPTO 2004