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)- Practical dynamic group signatures without knowledge extractors
- IBE Under $$k$$-LIN with Shorter Ciphertexts and Private Keys
- Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- A code-based group signature scheme
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
- Information Security and Privacy
- Scored anonymous credentials
- Key-Private Proxy Re-encryption
- Non-interactive confirmer signatures
- Round-optimal password-based authenticated key exchange
- A novel scheme of anonymous authentication on trust in pervasive social networking
- Efficient attribute-based signature for monotone predicates
- On the impossibility of purely algebraic signatures
- Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric
- New short group signature scheme without random oracles
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Homomorphic signatures for subset and superset mixed predicates and its applications
- A multi-group signature scheme from lattices
- Generic transformation to strongly existentially unforgeable signature schemes with continuous leakage resiliency
- An algebraic framework for Diffie-Hellman assumptions
- Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- Simulatable adaptive oblivious transfer with statistical receiver's privacy
- Universally Composable Adaptive Oblivious Transfer
- PAChain: private, authenticated and auditable consortium blockchain
- Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions
- Plaintext-checkable encryption
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Information Security and Cryptology
- Non-malleable Codes with Split-State Refresh
- Universally Composable Adaptive Priced Oblivious Transfer
- On the tightness of forward-secure signature reductions
- A practical group signature scheme based on rank metric
- Efficient Tate pairing computation using double-base chains
- Compact Group Signatures Without Random Oracles
- Unlinkable Randomizable Signature and Its Application in Group Signature
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Leakage resilience from program obfuscation
- Towards restricting plaintext space in public key encryption
- Attribute-based signatures for range of inner product and its applications
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Short Undeniable Signatures Without Random Oracles: The Missing Link
- An anonymous designated verifier signature scheme with revocation: how to protect a company's reputation
- Privacy-Aware Attribute-Based Encryption with User Accountability
- ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge
- A scalable post-quantum hash-based group signature
- Scalable multi-party private set-intersection
- Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
- Updatable NIZKs from non-interactive zaps
- Universally Anonymous IBE Based on the Quadratic Residuosity Assumption
- Offline witness encryption with semi-adaptive security
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Ensuring attribute privacy protection and fast decryption for outsourced data security in mobile cloud computing
- Shorter ring signatures from standard assumptions
- A black-box construction of strongly unforgeable signature scheme in the leakage setting
- Still wrong use of pairings in cryptography
- Leakage-resilient group signature: definitions and constructions
- Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
- Non-zero inner product encryption with short ciphertexts and private keys
- A dynamic attribute-based authentication scheme
- Efficient selective identity-based encryption without random oracles
- Dynamic fully anonymous short group signatures
- Attribute-based encryption schemes with constant-size ciphertexts
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- LESPP: lightweight and efficient strong privacy preserving authentication scheme for secure VANET communication
- Information and Communications Security
- Hidden-Vector Encryption with Groups of Prime Order
- No-signaling linear PCPs
- Survey of lattice-based group signature
- Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
- Adequate elliptic curves for computing the product of \(n\) pairings
- Security Analysis of the Strong Diffie-Hellman Problem
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- Practical Short Signature Batch Verification
- Anonymous yet Traceable Strong Designated Verifier Signature
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- Pairings in Trusted Computing
- 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
- Computing on authenticated data
- Algebraic curves and cryptography
- CCA-secure inner-product functional encryption from projective hash functions
- Smooth NIZK arguments
- Multilinear maps from obfuscation
- Structure-preserving signatures and commitments to group elements
- A lattice-based group signature scheme with verifier-local revocation
- Minicrypt primitives with algebraic structure and applications
- How to protect privacy in optimistic fair exchange of digital signatures
- Group-oriented fair exchange of signatures
- New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
- Deterministic Public-Key Encryption Under Continual Leakage
- DualDory: logarithmic-verifier linkable ring signatures through preprocessing
- Secure simultaneous bit extraction from Koblitz curves
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- A comparison of MNT curves and supersingular curves
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)
