scientific article; zbMATH DE number 2081084
From MaRDI portal
Publication:4474196
zbMATH Open1064.94554MaRDI QIDQ4474196FDOQ4474196
Authors: Dan Boneh, Ben Lynn, Hovav Shacham 
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2248/22480514.htm
Title of this publication is not available (Why is that?)
Recommendations
Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)
Cited In (only showing first 100 items - show all)
- Using abelian varieties to improve pairing-based cryptography
- On the security of two identity-based signature schemes based on pairings
- ID-Based Blind Signature and Proxy Blind Signature without Trusted PKG
- Salvaging Merkle-Damgård for Practical Applications
- Certificateless message recovery signatures providing Girault's level-3 security
- Identity-based threshold decryption on access structure
- Efficient ID-Based Digital Signatures with Message Recovery
- A pairing-based publicly verifiable secret sharing scheme
- One-Round ID-Based Blind Signature Scheme without ROS Assumption
- Efficient selective identity-based encryption without random oracles
- A method for constructing a self-dual normal basis in odd characteristic extension fields
- Formal Security Treatments for Signatures from Identity-Based Encryption
- Enhanced short signature scheme with hybrid problems
- Practical Short Signature Batch Verification
- Breaking the short certificateless signature scheme
- Designing efficient proxy signature schemes for mobile communication
- How to construct secure proxy cryptosystem
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- On bilinear structures on divisor class groups
- Generic security-amplifying methods of ordinary digital signatures
- Structure-preserving signatures and commitments to group elements
- Programmable hash functions and their applications
- Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal
- Identity-based trapdoor mercurial commitments and applications
- An enhanced \((t,n)\) threshold directed signature scheme
- Hybrid proxy multisignature: a new type multi-party signature
- Secure proxy signature schemes for delegation of signing rights
- Security weakness in a three-party pairing-based protocol for password authenticated key exchange
- Provably secure identity-based authenticated key agreement protocols with malicious private key generators
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Server-Aided Verification Signatures: Definitions and New Constructions
- Short signatures from the Weil pairing
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves
- Efficient certificateless proxy signature scheme with provable security
- Another Approach to Pairing Computation in Edwards Coordinates
- Efficient and Short Certificateless Signature
- Provably secure non-interactive key distribution based on pairings
- A new universal designated verifier transitive signature scheme for big graph data
- New identity-based society oriented signature schemes from pairings on elliptic curves
- Asymmetric Group Key Agreement
- High-speed high-security signatures
- Efficient identity-based authenticated key agreement protocol from pairings
- Programmable Hash Functions and Their Applications
- A taxonomy of pairing-friendly elliptic curves
- Efficient proxy signcryption scheme with provable CCA and CMA security
- Efficient generic on-line/off-line (threshold) signatures without key exposure
- Efficient algorithms for secure outsourcing of bilinear pairings
- Generating more MNT elliptic curves
- Provably secure server-aided verification signatures
- Identity-based key distribution for mobile ad hoc networks
- New \((t, n)\) threshold directed signature scheme with provable security
- Practical Identity-Based Encryption Without Random Oracles
- Public Key Cryptography – PKC 2004
- Finding Invalid Signatures in Pairing-Based Batches
- A Certificate-Based Proxy Cryptosystem with Revocable Proxy Decryption Power
- Algebraic (trapdoor) one-way functions: constructions and applications
- Further refinement of pairing computation based on Miller's algorithm
- Identity-based authenticated encryption with identity confidentiality
- Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility
- One forward-secure signature scheme using bilinear maps and its applications
- Generalized public-key cryptography with tight security
- Certificate-based verifiably encrypted signatures from pairings
- A Provably Secure Ring Signature Scheme in Certificateless Cryptography
- Certificateless signature and proxy signature schemes from bilinear pairings
- An identity-based strongly unforgeable signature without random oracles from bilinear pairings
- Integer Variable χ–Based Ate Pairing
- Private key agreement and secure communication for heterogeneous sensor networks
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
- Several security schemes constructed using ECC-based self-certified public key cryptosystems
- Signal-flow-based analysis of wireless security protocols
- Security of BLS and BGLS signatures in a multi-user setting
- Efficient Tate pairing computation using double-base chains
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five
- Generic construction for tightly-secure signatures from discrete log
- EPID with malicious revocation
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
- Efficient discrete logarithm based multi-signature scheme in the plain public key model
- Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
- Identity-based matchmaking encryption from standard assumptions
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- Secure Proxy Multi-signature Scheme in the Standard Model
- Pairing-based cryptography on elliptic curves
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Optimal security proofs for full domain hash. Revisited
- Escrow-free encryption supporting cryptographic workflow
- Subgroup security in pairing-based cryptography
- Oblivious signature-based envelope
- Secure simultaneous bit extraction from Koblitz curves
- A comparison of MNT curves and supersingular curves
- qDSA: small and secure digital signatures with curve-based Diffie-Hellman key pairs
- A provably secure short signature scheme based on discrete logarithms
- FAS: forward secure sequential aggregate signatures for secure logging
- On computable isomorphisms in efficient asymmetric pairing-based systems
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
- On constructing families of pairing-friendly elliptic curves with variable discriminant
- Public audit for operation behavior logs with error locating in cloud storage
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474196)
