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
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)
- 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
- A comparison of MNT curves and supersingular curves
- Cryptographic assumptions: a position paper
- Structure-preserving smooth projective hashing
- Private polynomial commitments and applications to MPC
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Fully adaptive decentralized multi-authority \textsf{ABE}
- On computable isomorphisms in efficient asymmetric pairing-based systems
- The kernel matrix Diffie-Hellman assumption
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
- Multilinear maps from obfuscation
- An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks
- More constructions of lossy and correlation-secure trapdoor functions
- Anonymous and leakage resilient IBE and IPE
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Linearly homomorphic structure-preserving signatures and their applications
- A lattice-based group signature scheme with message-dependent opening
- Solutions to the anti-piracy problem in oblivious transfer
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
- Compact privacy protocols from post-quantum and timed classical assumptions
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Selectively linkable group signatures -- stronger security and preserved verifiability
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Statistical ZAPR arguments from bilinear maps
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
- A lattice-based fully dynamic group signature scheme without NIZK
- Verifiable random functions from standard assumptions
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
- Group Encryption
- Compact structure-preserving signatures with almost tight security
- Witness maps and applications
- Foundations of fully dynamic group signatures
- Multiparty cardinality testing for threshold private intersection
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Self-organized anonymous authentication in mobile ad hoc networks
- A CCA-full-anonymous group signature with verifiable controllable linkability in the standard model
- Compact Ring Signature in the Standard Model for Blockchain
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions
- On the tightness of forward-secure signature reductions
- 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
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)