Tightly secure signatures from lossy identification schemes (Q315555): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6628973 / rank
 
Normal rank
Property / zbMATH Keywords
 
signature schemes
Property / zbMATH Keywords: signature schemes / rank
 
Normal rank
Property / zbMATH Keywords
 
tight reductions
Property / zbMATH Keywords: tight reductions / rank
 
Normal rank
Property / zbMATH Keywords
 
Fiat-Shamir
Property / zbMATH Keywords: Fiat-Shamir / 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/s00145-015-9203-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063831477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightly-Secure Signatures from Lossy Identification Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Generic Algorithms for Hard Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Security of Digital Signatures-How to Sign with RSA and Rabin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kangaroos, monopoly and discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bonsai Trees, or How to Delegate a Lattice Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient CDH-Based Signature Scheme with a Tight Security Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4394211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line/off-line digital signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved pseudo-random generator based on the discrete logarithm problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Hash-and-Sign Signatures Without the Random Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient signature schemes with tight reductions to the Diffie-Hellman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fly authentication and signature schemes based on groups of unknown order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3495643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short and Stateless Signatures from the RSA Assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient cryptographic schemes provably as secure as subset sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography – PKC 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving low-density subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Identification Schemes Secure Under Active Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Signatures without Trapdoors / 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: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the exact security of digital signature schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security arguments for digital signatures and blind signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient signature generation by smart cards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Public Key Encryption Based on Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Diffie-Hellman Key Agreement with Short Exponents / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:14, 12 July 2024

scientific article
Language Label Description Also known as
English
Tightly secure signatures from lossy identification schemes
scientific article

    Statements

    Tightly secure signatures from lossy identification schemes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 September 2016
    0 references
    signature schemes
    0 references
    tight reductions
    0 references
    Fiat-Shamir
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers