Short signatures from the Weil pairing
From MaRDI portal
Publication:1772229
DOI10.1007/s00145-004-0314-9zbMath1070.94010OpenAlexW2014239329WikidataQ60961118 ScholiaQ60961118MaRDI QIDQ1772229
Hovav Shacham, Dan Boneh, Ben Lynn
Publication date: 15 April 2005
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-004-0314-9
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
Digital Signatures with Memory-Tight Security in the Multi-challenge Setting, Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge, Keyword-Based Delegable Proofs of Storage, Optimal generic attack against basic Boneh-Boyen signatures, Obtaining simulation extractable NIZKs in the updatable CRS model generically, Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier, Group testing aggregate signatures with soundness, Random oracle combiners: breaking the concatenation barrier for collision-resistance, Better than advertised security for non-interactive threshold signatures, Stronger security and generic constructions for adaptor signatures, \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation, How to recover a secret with \(O(n)\) additions, On the security of two identity-based signature schemes based on pairings, Practical algorithm substitution attack on extractable signatures, How to build an ideal cipher: the indifferentiability of the Feistel construction, Efficient three-party authenticated key agreement protocol in certificateless cryptography, Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields, FROST: Flexible round-optimized Schnorr threshold signatures, Efficient hash maps to \(\mathbb{G}_2\) on BLS curves, Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles, Provably secure and pairing-based strong designated verifier signature scheme with message recovery, Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$, A reduction of security notions in designated confirmer signatures, Secure data storage in cloud: an e-stream cipher-based secure and dynamic updation policy, LOVE a pairing, Multi-use and unidirectional identity-based proxy re-encryption schemes, Efficient attribute-based proxy re-encryption with constant size ciphertexts, A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption, Compact proofs of retrievability, A New Public Remote Integrity Checking Scheme with User Privacy, Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree, Accountable identity-based encryption with distributed private key generators, On the multi-user security of short Schnorr signatures with preprocessing, Key regeneration-free ciphertext-policy attribute-based encryption and its application, Secure server-aided data sharing clique with attestation, Anonymous and leakage resilient IBE and IPE, Short signatures from Diffie-Hellman: realizing almost compact public key, Batch verification of short signatures, Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings, Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge, KCI-resilient anonymous wireless link-layer authentication protocols, Towards Tightly Secure Lattice Short Signature and Id-Based Encryption, New results and applications for multi-secret sharing schemes, Shorter identity-based encryption via asymmetric pairings, A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function, Short signatures without random oracles and the SDH assumption in bilinear groups, Privacy preserving multi-party computation delegation for deep learning in cloud computing, Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves, Extended KCI attack against two-party key establishment protocols, Multi-verifier signatures, Provably-secure time-bound hierarchical key assignment schemes, Programmable hash functions and their applications, A new provably secure certificateless short signature scheme, Improved Pollard rho method for computing discrete logarithms over finite extension fields, Heuristics of the Cocks-Pinch method, Surnaming Schemes, Fast Verification, and Applications to SGX Technology, Speeding-up verification of digital signatures, Nested cover-free families for unbounded fault-tolerant aggregate signatures, Design of improved password authentication and update scheme based on elliptic curve cryptography, Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions, Generalized public-key cryptography with tight security, Optimistic fair exchange in the enhanced chosen-key model, On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves, On the security of one-round meeting location determination protocol, Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES, RNS arithmetic in 𝔽 pk and application to fast pairing computation, An efficient certificateless aggregate signature with conditional privacy-preserving for vehicular sensor networks, The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem, Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two, New Constructions and Applications of Trapdoor DDH Groups, Algebraic curves and cryptography, Updating key size estimations for pairings, Security Analysis of the Strong Diffie-Hellman Problem, The Function Field Sieve in the Medium Prime Case, Sequential Aggregate Signatures and Multisignatures Without Random Oracles, Time-selective convertible undeniable signatures with short conversion receipts, Programmable Hash Functions and Their Applications, On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited, A Provably Secure One-Pass Two-Party Key Establishment Protocol, Compact Proofs of Retrievability, On the embedding degree of reductions of an elliptic curve, Revisiting Pairing Based Group Key Exchange, Proxy Signatures Secure Against Proxy Key Exposure, An Analysis of the Vector Decomposition Problem, Discrete logarithm problems with auxiliary inputs, Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography, Pairings for cryptographers, Comments on: ``A secure anti-collusion data sharing scheme for dynamic groups in the cloud, Separation Results on the “One-More” Computational Problems, Practical Short Signature Batch Verification, Computing pairings using \(x\)-coordinates only, Realizing Hash-and-Sign Signatures under Standard Assumptions, Public Cloud Data Auditing with Practical Key Update and Zero Knowledge Privacy, Identity-Based Group Encryption, Delay encryption, Verifiable Security of Boneh-Franklin Identity-Based Encryption, Faster Pairings on Special Weierstrass Curves, On Software Parallel Implementation of Cryptographic Pairings, Identity-Based Deterministic Signature Scheme without Forking-Lemma, Beta Weil pairing revisited, Using abelian varieties to improve pairing-based cryptography, Identity-based signatures in standard model, Simple Schnorr multi-signatures with applications to bitcoin, On the relationship between squared pairings and plain pairings, Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves, Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures, Efficient Round-Optimal Blind Signatures in the Standard Model, Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves, Adequate Elliptic Curves for Computing the Product of n Pairings, Partially structure-preserving signatures: lower bounds, constructions and more, Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model, On instantiating the algebraic group model from falsifiable assumptions
