Lattice-Based Identification Schemes Secure Under Active Attacks (Q5445452): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-78440-1_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163469693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sieve algorithm for the shortest lattice vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing short linearly independent vectors and short bases in a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-knowledge proofs of identity / 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: On the fly authentication and signature schemes based on groups of unknown order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3495643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Polynomial-Factor Approximations to the Shortest Lattice Vector Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / 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: Q3579369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4950039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lattice based cryptographic constructions / 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: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of a practical identification scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new paradigm for public key identification / rank
 
Normal rank

Latest revision as of 18:15, 27 June 2024

scientific article; zbMATH DE number 5242567
Language Label Description Also known as
English
Lattice-Based Identification Schemes Secure Under Active Attacks
scientific article; zbMATH DE number 5242567

    Statements

    Lattice-Based Identification Schemes Secure Under Active Attacks (English)
    0 references
    0 references
    5 March 2008
    0 references
    0 references
    0 references