Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311552
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
Cited in
(only showing first 100 items - show all)- Efficient completely context-hiding quotable and linearly homomorphic signatures
- Tagged one-time signatures: tight security and optimal tag size
- Security in Communication Networks
- Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Traceable identity-based group signature
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Efficient Traceable Signatures in the Standard Model
- Several cryptographic applications of \(\Sigma\)-protocol
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- Further refinement of pairing computation based on Miller's algorithm
- Efficient traceable signatures in the standard model
- Generic transformation to strongly existentially unforgeable signature schemes with continuous leakage resiliency
- Group-oriented fair exchange of signatures
- Attribute-based encryption schemes with constant-size ciphertexts
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- A generic scheme of plaintext-checkable database encryption
- Attribute-based signatures
- Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
- Comparing two pairing-based aggregate signature schemes
- Shorter identity-based encryption via asymmetric pairings
- Privacy-Aware Attribute-Based Encryption with User Accountability
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Zero-knowledge proofs of retrievability
- Dynamic fully anonymous short group signatures
- Cryptography in the multi-string model
- Short attribute-based signatures for threshold predicates
- Inner-product encryption under standard assumptions
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- Homomorphic Encryption and Signatures from Vector Decomposition
- Fully leakage-resilient signatures
- Key-Private Proxy Re-encryption
- Round-optimal password-based authenticated key exchange
- Security Analysis of the Strong Diffie-Hellman Problem
- Non-malleable Codes with Split-State Refresh
- Ambiguous Optimistic Fair Exchange
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- Short Undeniable Signatures Without Random Oracles: The Missing Link
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Practical Short Signature Batch Verification
- Fully Anonymous Group Signatures Without Random Oracles
- Efficient oblivious transfers with access control
- An algebraic framework for Diffie-Hellman assumptions
- Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Unconditionally anonymous ring and mesh signatures
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Fixed argument pairing inversion on elliptic curves
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Plaintext-checkable encryption
- Efficient selective identity-based encryption without random oracles
- Defending against key abuse attacks in KP-ABE enabled broadcast systems
- Securely obfuscating re-encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Compact Group Signatures Without Random Oracles
- A code-based group signature scheme
- Concurrently composable security with shielded super-polynomial simulators
- Ensuring attribute privacy protection and fast decryption for outsourced data security in mobile cloud computing
- Pairings in Trusted Computing
- Pairings for cryptographers
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
- Structure-preserving signatures and commitments to group elements
- Tightly secure signatures and public-key encryption
- Ambiguous optimistic fair exchange: definition and constructions
- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
- Discrete logarithm problems with auxiliary inputs
- Information Security and Privacy
- Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
- Structure-preserving smooth projective hashing
- A CCA-full-anonymous group signature with verifiable controllable linkability in the standard model
- Non-zero inner product encryption with short ciphertexts and private keys
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- A practical group signature scheme based on rank metric
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
- Multiparty cardinality testing for threshold private intersection
- Verifiable elections that scale for free
- Private polynomial commitments and applications to MPC
- Fully secure functional encryption for inner products, from standard assumptions
- Efficient Tate pairing computation using double-base chains
- A shuffle argument secure in the generic model
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions
- DualDory: logarithmic-verifier linkable ring signatures through preprocessing
- Group Encryption
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Linearly homomorphic structure-preserving signatures and their applications
- A black-box construction of strongly unforgeable signature scheme in the leakage setting
- A scalable post-quantum hash-based group signature
- More constructions of lossy and correlation-secure trapdoor functions
- A lattice-based group signature scheme with message-dependent opening
- Compact structure-preserving signatures with almost tight security
- CCA-secure inner-product functional encryption from projective hash functions
- Smooth NIZK arguments
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
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)
