Pages that link to "Item:Q1772229"
From MaRDI portal
The following pages link to Short signatures from the Weil pairing (Q1772229):
Displaying 25 items.
- Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures (Q5504619) (← links)
- Efficient Round-Optimal Blind Signatures in the Standard Model (Q5854440) (← links)
- Public Key Cryptography – PKC 2004 (Q5901808) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
- Discrete logarithm problems with auxiliary inputs (Q5962223) (← links)
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting (Q6041292) (← links)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- Keyword-Based Delegable Proofs of Storage (Q6108620) (← links)
- Obtaining simulation extractable NIZKs in the updatable CRS model generically (Q6118305) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- Better than advertised security for non-interactive threshold signatures (Q6166964) (← links)
- Stronger security and generic constructions for adaptor signatures (Q6169457) (← links)
- Signature Schemes with Randomized Verification (Q6487210) (← links)
- A tightly secure ID-based signature scheme under DL assumption in AGM (Q6535485) (← links)
- Threshold structure-preserving signatures (Q6562572) (← links)
- Robust subgroup multisignature with one-time public keys in order (Q6569891) (← links)
- The unique chain rule and its applications (Q6573946) (← links)
- Eagle: efficient privacy preserving smart contracts (Q6573970) (← links)
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing (Q6582221) (← links)
- \textsf{TOPAS} 2-pass key exchange with full perfect forward secrecy and optimal communication complexity (Q6618628) (← links)
- A computational Diffie-Hellman-based insider secure signcryption with non-interactive non-repudiation (Q6629098) (← links)
- Formalizing hash-then-sign signatures (Q6635754) (← links)
- New proof systems and an OPRF from CSIDH (Q6635825) (← links)
- Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees \(k=5,7\) (Q6637057) (← links)
- Pairing-free blind signatures from CDH assumptions (Q6648192) (← links)
