Lattice-Based Identification Schemes Secure Under Active Attacks

doi 10.1007/978-3-540-78440-1_10
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

GQ and Schnorr Identification Schemes: Proofs of Security Against Impersonation Under Active and Concurrent Attacks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Encryption Schemes Secure Against Chosen-Ciphertext Selective Opening Attacks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Sender-Equivocable Encryption Schemes Secure Against Chosen-Ciphertext Attacks Revisited

International Journal of Applied Mathematics and Computer Science
2015English

Provably Secure Identity-Based Identification and Signature Schemes From Code Assumptions

PLoS ONE
Multidisciplinary
2017English

Tightly Secure Signatures From Lossy Identification Schemes

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2015English

Fast Server-Aided RSA Signatures Secure Against Active Attacks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Wiretap-Channels Under Constrained Active and Passive Attacks

2015English

Conditional Adjacency Anonymity in Social Graphs Under Active Attacks

Knowledge and Information Systems
Information SystemsHuman-Computer InteractionHardwareArchitectureArtificial IntelligenceSoftware
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy