Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311552
DOI10.1007/b99099zbMath1104.94044OpenAlexW2477011922WikidataQ27980744 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
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
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 Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation, DualDory: logarithmic-verifier linkable ring signatures through preprocessing, Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric, Attribute-based signatures for range of inner product and its applications, Efficient NIZKs for algebraic sets, Identity-Based Encryption Resilient to Auxiliary Leakage under the Decisional Linear Assumption, Compact Ring Signature in the Standard Model for Blockchain, A survey on functional encryption, Updatable NIZKs from non-interactive zaps, Threshold signatures with private accountability, Indistinguishability obfuscation, Compact structure-preserving signatures with almost tight security, A scalable post-quantum hash-based group signature, Structure-preserving signatures and commitments to group elements, Smooth NIZK arguments, Tightly secure signatures and public-key encryption, LESPP: lightweight and efficient strong privacy preserving authentication scheme for secure VANET communication, Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares, Predicate encryption supporting disjunctions, polynomial equations, and inner products, Implementing secure reporting of sexual misconduct -- revisiting WhoToo, Further refinement of pairing computation based on Miller's algorithm, Unconditionally anonymous ring and mesh signatures, Constant-size structure-preserving signatures: generic constructions and simple assumptions, \textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme, Selectively linkable group signatures -- stronger security and preserved verifiability, Security analysis of DGM and GM group signature schemes instantiated with XMSS-T, The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures, Skipping the \(q\) in group signatures, Step-out group signatures, Fully leakage-resilient signatures, A comparison of MNT curves and supersingular curves, Zero-knowledge proofs of retrievability, On computable isomorphisms in efficient asymmetric pairing-based systems, Anonymous single-sign-on for \(n\) designated services with traceability, Group signatures and more from isogenies and lattices: generic, simple, and efficient, Anonymous and leakage resilient IBE and IPE, Round-optimal password-based authenticated key exchange, Linearly homomorphic structure-preserving signatures and their applications, Multilinear maps from obfuscation, Shorter identity-based encryption via asymmetric pairings, Structure-preserving signatures on equivalence classes and constant-size anonymous credentials, Short signatures without random oracles and the SDH assumption in bilinear groups, A novel scheme of anonymous authentication on trust in pervasive social networking, Solutions to the anti-piracy problem in oblivious transfer, Attribute-based encryption schemes with constant-size ciphertexts, Group homomorphic encryption: characterizations, impossibility results, and applications, Shorter quasi-adaptive NIZK proofs for linear subspaces, Efficient traceable signatures in the standard model, Inner-product encryption under standard assumptions, MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system, CCA updatable encryption against malicious re-encryption attacks, More constructions of lossy and correlation-secure trapdoor functions, Practical dynamic group signatures without knowledge extractors, Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting), Group-oriented fair exchange of signatures, Fully-succinct publicly verifiable delegation from constant-size assumptions, Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH, On the impossibility of purely algebraic signatures, A CCA-full-anonymous group signature with verifiable controllable linkability in the standard model, Efficient attribute-based signature for monotone predicates, Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions, Efficient oblivious transfers with access control, New technique for chosen-ciphertext security based on non-interactive zero-knowledge, On the tightness of forward-secure signature reductions, Securely obfuscating re-encryption, Efficient selective identity-based encryption without random oracles, Several cryptographic applications of \(\Sigma\)-protocol, Ambiguous optimistic fair exchange: definition and constructions, Offline witness encryption with semi-adaptive security, Strongly secure authenticated key exchange from factoring, codes, and lattices, Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES, Fixed argument pairing inversion on elliptic curves, A code-based group signature scheme, An algebraic framework for Diffie-Hellman assumptions, A lattice-based group signature scheme with verifier-local revocation, New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem, How to protect privacy in optimistic fair exchange of digital signatures, Efficient Tate pairing computation using double-base chains, The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem, Secure simultaneous bit extraction from Koblitz curves, Leakage-resilient group signature: definitions and constructions, Comparing two pairing-based aggregate signature schemes, Fully collusion-resistant traitor tracing scheme with shorter ciphertexts, Fully secure functional encryption with a large class of relations from the decisional linear assumption, On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited, Verifiable Random Functions from Standard Assumptions, Multilinear Maps from Obfuscation, Cryptographic Assumptions: A Position Paper, Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs, Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model, Pairings for cryptographers, Short fail-stop signature scheme based on factorization and discrete logarithm assumptions, Ensuring attribute privacy protection and fast decryption for outsourced data security in mobile cloud computing, An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks, Cryptography in the multi-string model, Verifiable random functions: relations to identity-based key encapsulation and new constructions, Towards Lightweight Anonymous Entity Authentication for IoT Applications, Linear Encryption with Keyword Search, 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, Foundations of Fully Dynamic Group Signatures, A Lattice-Based Group Signature Scheme with Message-Dependent Opening, Multiparty cardinality testing for threshold private intersection, Beta Weil pairing revisited, Leakage resilience from program obfuscation, A generic scheme of plaintext-checkable database encryption, Still wrong use of pairings in cryptography, An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users, Computing on authenticated data, ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability
