Pairings for cryptographers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1643939 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A taxonomy of pairing-friendly elliptic curves
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Elliptic Curve Cryptography
- Efficient pairing computation on supersingular abelian varieties
- Elliptic curves with low embedding degree
- On computable isomorphisms in efficient asymmetric pairing-based systems
- Short signatures from the Weil pairing
- The Eta Pairing Revisited
Cited in
(only showing first 100 items - show all)- Efficient statically-secure large-universe multi-authority attribute-based encryption
- Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
- Pairing Lattices
- Cut down the tree to achieve constant complexity in divisible e-cash
- Keyword-Based Delegable Proofs of Storage
- EPID with malicious revocation
- Multi-party revocation in sovrin: performance through distributed trust
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- An efficient attribute-based access control system with break-glass capability for cloud-assisted industrial control system
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- A practical compiler for attribute-based encryption: new decentralized constructions and more
- Short concurrent covert authenticated key exchange (short cAKE)
- Threshold structure-preserving signatures
- Batch verification of short signatures
- Sequential aggregate signatures with short public keys: design, analysis and implementation studies
- Still wrong use of pairings in cryptography
- Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
- Efficient selective identity-based encryption without random oracles
- An efficient certificate-based signature scheme in the standard model
- Certificateless public key encryption with equality test
- Extendable threshold ring signatures with enhanced anonymity
- Pairings in Trusted Computing
- Subgroup security in pairing-based cryptography
- Hierarchical integrated signature and encryption. (or: key separation vs. key reuse: enjoy the best of both worlds)
- Structure-preserving signatures and commitments to group elements
- Identity-based encryption with hierarchical key-insulation in the standard model
- Efficient Protocols for Set Membership and Range Proofs
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Improved hidden vector encryption with short ciphertexts and tokens
- Witness encryption from smooth projective hashing system
- Provably secure and pairing-based strong designated verifier signature scheme with message recovery
- Pointcheval-Sanders signature-based synchronized aggregate signature
- Smooth zero-knowledge hash functions
- Practical (fully) distributed signatures provably secure in the standard model
- Rerandomizable signatures under standard assumption
- A reduction of security notions in designated confirmer signatures
- A new approach to practical function-private inner product encryption
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Efficient self-pairing on ordinary elliptic curves
- Curves with Fast Computations in the First Pairing Group
- Scalable Divisible E-cash
- You can sign but not decrypt: hierarchical integrated encryption and signature
- An efficient self-blindable attribute-based credential scheme
- Short Integrated PKE+PEKS in Standard Model
- Public Key Encryption with Flexible Pattern Matching
- Partially structure-preserving signatures: lower bounds, constructions and more
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- On subversion-resistant SNARKs
- Parallelizing the Weil and Tate pairings
- Match me if you can: matchmaking encryption and its applications
- Discrete logarithm problems with auxiliary inputs
- Efficient and universally composable single secret leader election from pairings
- Forgeability of Wang-Zhu-Feng-Yau's attribute-based signature with policy-and-endorsement mechanism
- \textsf{TOPAS} 2-pass key exchange with full perfect forward secrecy and optimal communication complexity
- A signature scheme with efficient proof of validity
- Subversion-resilient enhanced privacy ID
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Dynamic universal accumulator with batch update over bilinear groups
- Skipping the \(q\) in group signatures
- A taxonomy of pairing-friendly elliptic curves
- KCI-resilient anonymous wireless link-layer authentication protocols
- Constant size ring signature without random oracle
- Attribute-based anonymous credential: optimization for single-use and multi-use
- A brief history of pairings
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
- Group signatures with user-controlled and sequential linkability
- Public-Key Encryption with Delegated Search
- Offline witness encryption
- Efficient algorithms for secure outsourcing of bilinear pairings
- Selectively linkable group signatures -- stronger security and preserved verifiability
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Designated confirmer signatures with unified verification
- Anonymous single-sign-on for \(n\) designated services with traceability
- Efficient round-optimal blind signatures in the standard model
- Efficient redactable signature and application to anonymous credentials
- Efficient revocable identity-based encryption with short public parameters
- Tagged one-time signatures: tight security and optimal tag size
- Non-interactive multisignatures in the plain public-key model with efficient verification
- Improving revocation for group signature with redactable signature
- Guide to pairing-based cryptography
- Aggregatable distributed key generation
- New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
- Efficient Fully-Simulatable Oblivious Transfer
- CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (Not $$\mathtt {q}$$ -type) Assumptions
- Comparing two pairing-based aggregate signature schemes
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
- Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
- On the efficient implementation of pairing-based protocols
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Designing a code generator for pairing based cryptographic functions
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- DFE-IP: delegatable functional encryption for inner product
- Cryptographic group actions and applications
- A Leakage Resilient MAC
- ObliviousDB: Practical and Efficient Searchable Encryption with Controllable Leakage
- Identity-based authenticated encryption with identity confidentiality
- zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs
This page was built for publication: Pairings for cryptographers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003698)
