An Efficient Post-Quantum One-Time Signature Scheme (Q2807220): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Reihaneh Safavi-Naini / rank
Normal rank
 
Property / author
 
Property / author: Reihaneh Safavi-Naini / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SWIFFT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-31301-6_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2466492051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to construct optimal one-time signatures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal tree-based one-time digital signature schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Security of the Winternitz One-Time Signature Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: CMSS – An Improved Merkle Signature Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post-quantum cryptography: lattice signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative source encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line/off-line digital signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Transformation to Strongly Unforgeable Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Efficient Lattice-Based Digital Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: SWIFFT: A Modest Proposal for FFT Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Time Signatures and Chameleon Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Areas in Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Quantum Security for Post-Quantum Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short one-time signatures / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:17, 12 July 2024

scientific article
Language Label Description Also known as
English
An Efficient Post-Quantum One-Time Signature Scheme
scientific article

    Statements

    An Efficient Post-Quantum One-Time Signature Scheme (English)
    0 references
    0 references
    0 references
    19 May 2016
    0 references
    post-quantum cryptography
    0 references
    broadcast authentication
    0 references
    digital signatures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers