Advances in Cryptology – CRYPTO 2004

DOI10.1007/B99099zbMATH Open1104.94044DBLPconf/crypto/2004OpenAlexW2477011922MaRDI QIDQ5311552FDOQ5311552

Authors: Dan Boneh, Xavier Boyen, Hovav Shacham 

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

Recommendations

• Short threshold dynamic group signatures
• Short Group Signature Without Random Oracles
• Short undeniable signatures based on group homomorphisms
• Group Signatures
• Short group signatures with distributed traceability
• Dynamic fully anonymous short group signatures
• Short randomizable signatures
• Short structure-preserving signatures
• Short tightly secure signatures for signing a vector of group elements: a new approach

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)

Cited In (only showing first 100 items - show all)

• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• Short Undeniable Signatures Without Random Oracles: The Missing Link
• On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
• Privacy-Aware Attribute-Based Encryption with User Accountability
• Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
• Ensuring attribute privacy protection and fast decryption for outsourced data security in mobile cloud computing
• Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
• Dynamic fully anonymous short group signatures
• Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
• Efficient selective identity-based encryption without random oracles
• Attribute-based encryption schemes with constant-size ciphertexts
• Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
• Security Analysis of the Strong Diffie-Hellman Problem
• Practical Short Signature Batch Verification
• Pairings in Trusted Computing
• Structure-preserving signatures and commitments to group elements
• Predicate encryption supporting disjunctions, polynomial equations, and inner products
• Group-oriented fair exchange of signatures
• Inner-product encryption under standard assumptions
• Fully Anonymous Group Signatures Without Random Oracles
• Tightly secure signatures and public-key encryption
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures
• Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
• Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
• Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
• Short attribute-based signatures for threshold predicates
• Efficient oblivious transfers with access control
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• Pairings for cryptographers
• Discrete logarithm problems with auxiliary inputs
• Security in Communication Networks
• Efficient Traceable Signatures in the Standard Model
• Cryptography in the multi-string model
• Verifiable random functions: relations to identity-based key encapsulation and new constructions
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• Unconditionally anonymous ring and mesh signatures
• Shorter identity-based encryption via asymmetric pairings
• Several cryptographic applications of \(\Sigma\)-protocol
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
• Ambiguous optimistic fair exchange: definition and constructions
• Efficient completely context-hiding quotable and linearly homomorphic signatures
• Tagged one-time signatures: tight security and optimal tag size
• Traceable identity-based group signature
• Efficient traceable signatures in the standard model
• Defending against key abuse attacks in KP-ABE enabled broadcast systems
• Attribute-based signatures
• Zero-knowledge proofs of retrievability
• Comparing two pairing-based aggregate signature schemes
• Ambiguous Optimistic Fair Exchange
• Concurrently composable security with shielded super-polynomial simulators
• Strongly secure authenticated key exchange from factoring, codes, and lattices
• A generic scheme of plaintext-checkable database encryption
• Fully leakage-resilient signatures
• Homomorphic Encryption and Signatures from Vector Decomposition
• Fixed argument pairing inversion on elliptic curves
• Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
• Further refinement of pairing computation based on Miller's algorithm
• Securely obfuscating re-encryption
• Information Security and Privacy
• Key-Private Proxy Re-encryption
• A code-based group signature scheme
• The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
• Round-optimal password-based authenticated key exchange
• Generic transformation to strongly existentially unforgeable signature schemes with continuous leakage resiliency
• Public-key encryption with simulation-based selective-opening security and compact ciphertexts
• An algebraic framework for Diffie-Hellman assumptions
• Non-malleable Codes with Split-State Refresh
• Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
• Plaintext-checkable encryption
• Compact Group Signatures Without Random Oracles
• Universally Composable Adaptive Oblivious Transfer
• Efficient Tate pairing computation using double-base chains
• Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
• Scalable multi-party private set-intersection
• A scalable post-quantum hash-based group signature
• Universally Anonymous IBE Based on the Quadratic Residuosity Assumption
• Group homomorphic encryption: characterizations, impossibility results, and applications
• A black-box construction of strongly unforgeable signature scheme in the leakage setting
• Leakage-resilient group signature: definitions and constructions
• Non-zero inner product encryption with short ciphertexts and private keys
• Adequate elliptic curves for computing the product of \(n\) pairings
• Anonymous yet Traceable Strong Designated Verifier Signature
• Algebraic curves and cryptography
• Fully secure functional encryption with a large class of relations from the decisional linear assumption
• Fully secure functional encryption for inner products, from standard assumptions
• A shuffle argument secure in the generic model
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• CCA-secure inner-product functional encryption from projective hash functions
• DualDory: logarithmic-verifier linkable ring signatures through preprocessing
• Smooth NIZK arguments
• Multilinear maps from obfuscation
• Deterministic Public-Key Encryption Under Continual Leakage
• A lattice-based group signature scheme with verifier-local revocation
• How to protect privacy in optimistic fair exchange of digital signatures
• New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
• Secure simultaneous bit extraction from Koblitz curves
• Verifiable elections that scale for free
• Efficient public-key cryptography with bounded leakage and tamper resilience
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311552)