The following pages link to Pairings for cryptographers (Q1003698):
Displaying 44 items.
- Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions (Q2790054) (← links)
- Scalable Divisible E-cash (Q2794505) (← links)
- Offline Witness Encryption (Q2822676) (← links)
- Guide to pairing-based cryptography (Q2832131) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability (Q2946483) (← links)
- Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption (Q2948190) (← links)
- New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters (Q2975823) (← links)
- A Signature Scheme with Efficient Proof of Validity (Q3005577) (← links)
- Public-Key Encryption with Delegated Search (Q3011319) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- On the Efficient Implementation of Pairing-Based Protocols (Q3104702) (← links)
- Designated Confirmer Signatures with Unified Verification (Q3104715) (← links)
- Constant Size Ring Signature Without Random Oracle (Q3194600) (← links)
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem (Q3392897) (← links)
- A Leakage Resilient MAC (Q3460113) (← links)
- Efficient Protocols for Set Membership and Range Proofs (Q3600378) (← links)
- Pairings in Trusted Computing (Q3600490) (← links)
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size (Q4916017) (← links)
- Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies (Q4916023) (← links)
- Efficient Self-pairing on Ordinary Elliptic Curves (Q4922135) (← links)
- Short Integrated PKE+PEKS in Standard Model (Q5055971) (← links)
- ObliviousDB: Practical and Efficient Searchable Encryption with Controllable Leakage (Q5056068) (← links)
- Efficient Fully-Simulatable Oblivious Transfer (Q5458932) (← links)
- Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash (Q5738783) (← links)
- An Efficient Self-blindable Attribute-Based Credential Scheme (Q5854421) (← links)
- Efficient Round-Optimal Blind Signatures in the Standard Model (Q5854440) (← links)
- Match me if you can: matchmaking encryption and its applications (Q5918327) (← links)
- Discrete logarithm problems with auxiliary inputs (Q5962223) (← links)
- Public Key Encryption with Flexible Pattern Matching (Q6041290) (← links)
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures (Q6041296) (← links)
- DFE-IP: delegatable functional encryption for inner product (Q6095585) (← links)
- Keyword-Based Delegable Proofs of Storage (Q6108620) (← links)
- You can sign but not decrypt: hierarchical integrated encryption and signature (Q6134008) (← links)
- Hierarchical integrated signature and encryption. (or: key separation vs. key reuse: enjoy the best of both worlds) (Q6157529) (← links)
- Smooth zero-knowledge hash functions (Q6157605) (← links)
- Attribute-based anonymous credential: optimization for single-use and multi-use (Q6164396) (← links)
- Curves with Fast Computations in the First Pairing Group (Q6488030) (← links)
- Threshold structure-preserving signatures (Q6562572) (← links)
- Short concurrent covert authenticated key exchange (short cAKE) (Q6562580) (← links)
- \textsf{TOPAS} 2-pass key exchange with full perfect forward secrecy and optimal communication complexity (Q6618628) (← links)
- Adaptively secure BLS threshold signatures from DDH and co-CDH (Q6653010) (← links)
- zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs (Q6660380) (← links)