scientific article; zbMATH DE number 2081084

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2248/22480514.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Related Items (only showing first 100 items - show all)

Unnamed Item ⋮ Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ Comment fail-stop blind signature scheme design based on pairings ⋮ Boneh-Franklin IBE ⋮ LESPP: lightweight and efficient strong privacy preserving authentication scheme for secure VANET communication ⋮ On the near prime-order MNT curves ⋮ Efficient Certificate-Based Signature and Its Aggregation ⋮ Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage ⋮ On methods of shortening ElGamal-type signatures ⋮ Linkable Message Tagging: Solving the Key Distribution Problem of Signature Schemes ⋮ Privacy-enhanced remote data integrity checking with updatable timestamp ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ Anonymous tokens with public metadata and applications to private contact tracing ⋮ Plumo: an ultralight blockchain client ⋮ SoK: blockchain light clients ⋮ Accountable Ciphertext-Policy Attribute-Based Encryption Scheme Supporting Public Verifiability and Nonrepudiation ⋮ Efficient Dynamic Provable Data Possession from Dynamic Binary Tree ⋮ On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6 ⋮ An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels ⋮ A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function ⋮ A Provably Secure Ring Signature Scheme in Certificateless Cryptography ⋮ Aggregate Proxy Signature and Verifiably Encrypted Proxy Signature ⋮ Formal Security Treatments for Signatures from Identity-Based Encryption ⋮ Accountable CP-ABE with Public Verifiability: How to Effectively Protect the Outsourced Data in Cloud ⋮ On the impossibility of purely algebraic signatures ⋮ Policy-compliant signatures ⋮ OrBit: OR-proof identity-based identification with tight security for (as low as) 1-bit loss ⋮ An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication ⋮ Reconstructing Generalized Staircase Polygons with Uniform Step Length ⋮ On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings ⋮ A provably secure short signature scheme based on discrete logarithms ⋮ A t-out-of-n Redactable Signature Scheme ⋮ A Signature Scheme with Efficient Proof of Validity ⋮ Hybrid proxy multisignature: a new type multi-party signature ⋮ New $(t, n)$ threshold directed signature scheme with provable security ⋮ Leakage-Resilient Revocable Identity-Based Signature with Cloud Revocation Authority ⋮ Indifferentiable deterministic hashing to elliptic and hyperelliptic curves ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies ⋮ Designing efficient proxy signature schemes for mobile communication ⋮ Provably secure non-interactive key distribution based on pairings ⋮ Generating more MNT elliptic curves ⋮ The Function Field Sieve in the Medium Prime Case ⋮ Practical Identity-Based Encryption Without Random Oracles ⋮ Programmable Hash Functions and Their Applications ⋮ ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message ⋮ Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility ⋮ Universally Composable Adaptive Oblivious Transfer ⋮ Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography ⋮ Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials ⋮ Integer Variable χ–Based Ate Pairing ⋮ One-Round ID-Based Blind Signature Scheme without ROS Assumption ⋮ Revisiting Pairing Based Group Key Exchange ⋮ Sanitizable and Deletable Signature ⋮ Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures ⋮ Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange ⋮ Finding Invalid Signatures in Pairing-Based Batches ⋮ Efficient KEMs with Partial Message Recovery ⋮ Verifier-Key-Flexible Universal Designated-Verifier Signatures ⋮ On the efficient generation of prime-order elliptic curves ⋮ Oblivious signature-based envelope ⋮ A Certificate-Based Proxy Cryptosystem with Revocable Proxy Decryption Power ⋮ Efficient ID-Based Digital Signatures with Message Recovery ⋮ Efficient Privacy Preserving Data Audit in Cloud ⋮ Practical Short Signature Batch Verification ⋮ Asymmetric Group Key Agreement ⋮ Salvaging Merkle-Damgård for Practical Applications ⋮ ID-Based Blind Signature and Proxy Blind Signature without Trusted PKG ⋮ Public Cloud Data Auditing with Practical Key Update and Zero Knowledge Privacy ⋮ Proxy Signature with Revocation ⋮ Identity-Based Group Encryption ⋮ Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography ⋮ Security of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher Model ⋮ Strongly Secure One Round Authenticated Key Exchange Protocol with Perfect Forward Security ⋮ Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model ⋮ Generating Pairing-Friendly Curves with the CM Equation of Degree 1 ⋮ Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates ⋮ Towards Security Notions for White-Box Cryptography ⋮ New Anonymity Notions for Identity-Based Encryption ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ Designated Confirmer Signatures with Unified Verification ⋮ On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant ⋮ New Anonymity Notions for Identity-Based Encryption ⋮ Escrow-free encryption supporting cryptographic workflow ⋮ Efficient and Short Certificateless Signature ⋮ Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography ⋮ Another Approach to Pairing Computation in Edwards Coordinates ⋮ Optimal Online/Offline Signature: How to Sign a Message without Online Computation ⋮ Secure Proxy Multi-signature Scheme in the Standard Model ⋮ Server-Aided Verification Signatures: Definitions and New Constructions ⋮ How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions ⋮ Certificateless signature and proxy signature schemes from bilinear pairings ⋮ Fail-stop blind signature scheme design based on pairings ⋮ Several security schemes constructed using ECC-based self-certified public key cryptosystems ⋮ Digital Signatures ⋮ A strong designated verifier signature scheme tightly related to the LRSW assumption ⋮ On the security of two identity-based signature schemes based on pairings

This page was built for publication: