Pages that link to "Item:Q1772229"
From MaRDI portal
The following pages link to Short signatures from the Weil pairing (Q1772229):
Displaying 50 items.
- On the security of two identity-based signature schemes based on pairings (Q264198) (← links)
- How to build an ideal cipher: the indifferentiability of the Feistel construction (Q271585) (← links)
- New results and applications for multi-secret sharing schemes (Q404940) (← links)
- Shorter identity-based encryption via asymmetric pairings (Q404944) (← links)
- Multi-verifier signatures (Q431790) (← links)
- Provably-secure time-bound hierarchical key assignment schemes (Q431793) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
- Optimistic fair exchange in the enhanced chosen-key model (Q476842) (← links)
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES (Q499658) (← links)
- A new provably secure certificateless short signature scheme (Q636560) (← links)
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem (Q683912) (← links)
- FROST: Flexible round-optimized Schnorr threshold signatures (Q832324) (← links)
- Time-selective convertible undeniable signatures with short conversion receipts (Q985073) (← links)
- On the embedding degree of reductions of an elliptic curve (Q989443) (← links)
- Pairings for cryptographers (Q1003698) (← links)
- Computing pairings using \(x\)-coordinates only (Q1009121) (← links)
- Using abelian varieties to improve pairing-based cryptography (Q1027984) (← links)
- On the relationship between squared pairings and plain pairings (Q1045941) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- Provably secure and pairing-based strong designated verifier signature scheme with message recovery (Q1637871) (← links)
- Secure data storage in cloud: an e-stream cipher-based secure and dynamic updation policy (Q1640423) (← links)
- On the security of one-round meeting location determination protocol (Q1739217) (← links)
- An efficient certificateless aggregate signature with conditional privacy-preserving for vehicular sensor networks (Q1749909) (← links)
- Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two (Q1751377) (← links)
- Comments on: ``A secure anti-collusion data sharing scheme for dynamic groups in the cloud'' (Q1799606) (← links)
- Batch verification of short signatures (Q1928768) (← links)
- KCI-resilient anonymous wireless link-layer authentication protocols (Q1933901) (← links)
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves (Q1943983) (← links)
- Extended KCI attack against two-party key establishment protocols (Q1944127) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Delay encryption (Q2056688) (← links)
- Partially structure-preserving signatures: lower bounds, constructions and more (Q2117038) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Practical algorithm substitution attack on extractable signatures (Q2119943) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- LOVE a pairing (Q2146100) (← links)
- Efficient attribute-based proxy re-encryption with constant size ciphertexts (Q2152056) (← links)
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree (Q2163356) (← links)
- On the multi-user security of short Schnorr signatures with preprocessing (Q2170064) (← links)
- Privacy preserving multi-party computation delegation for deep learning in cloud computing (Q2198099) (← links)
- Speeding-up verification of digital signatures (Q2220442) (← links)
- Nested cover-free families for unbounded fault-tolerant aggregate signatures (Q2220866) (← links)
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions (Q2223693) (← links)
- Generalized public-key cryptography with tight security (Q2225176) (← links)
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited (Q2275939) (← links)
- Beta Weil pairing revisited (Q2313463) (← links)
- Identity-based signatures in standard model (Q2317833) (← links)
