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

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-89255-7_23
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Lattice-Based Identification Schemes Secure Under Active Attacks

English

Worst -Case L1 Identification Based on Correlation Analysis

Transactions of the Institute of Systems, Control and Information Engineers
2000English

Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2019English

On Domain-Partitioning Induction Criteria: Worst-Case Bounds for the Worst-Case Based

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

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

A Secure Proxy Signature Scheme Based on the Hardness of the Decisional Diffie-Hellman Problem

Studies in Informatics and Control
Electronic EngineeringElectricalComputer Science
2012English

Multi-Bit Cryptosystems Based on Lattice Problems

English

Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy