[PDF] Top 20 Asymptotically Efficient Lattice-Based Digital Signatures
Has 10000 "Asymptotically Efficient Lattice-Based Digital Signatures" found on our website. Below are the top 20 most common "Asymptotically Efficient Lattice-Based Digital Signatures".
Asymptotically Efficient Lattice-Based Digital Signatures
... secure based on the hardness of finding collisions in a random ...instantiations based on SIS, Ring-SIS, or coding problems, we simply need to show that the sets used in the instantiations of these schemes ... See full document
25
Short Signatures With Short Public Keys From Homomorphic Trapdoor Functions
... cryptography based on various quantum-insecure number-theoretic problems such as RSA and ...very efficient commercial NTRUEncrypt scheme have been proved secure under worst-case lattice problems ... See full document
18
Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
... for lattice-based schemes by presenting a signature and com- mitment scheme that are compatible with Lyubashevsky’s Fiat-Shamir proofs with abort, currently the most efficient zero-knowledge proofs ... See full document
50
An Efficient Approach for Data Security in Cloud Environment using Watermarking Technique and RSA Digital Signatures
... Abstract - M ultimedia is the fast growing technology and almost all the mobile users need multimedia based applications. As mobile device have limited storage and simultaneously it cannot process other multimedia ... See full document
5
Efficient KEA-Style Lattice-Based Authenticated Key Exchange
... of lattice-based AKE protocols in the last few ...protocol based on (ring-)LWE, which was proposed by Ding et ...an efficient key encapsulation mechanism (KEM) based on ring-LWE, and ... See full document
19
Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability
... less efficient than ours is that in order to prove that the message is in a small set, the space of the messages and the challenges is restricted to a small-dimensional ... See full document
37
Subgraph Matching with Set Similarity in a Large Graph Database
... novel lattice-based index for data graph, and lightweight signatures for both query and data ...vertices. Based on the index and signatures, we propose an efficient two- phase ... See full document
6
Precomputation Methods for Faster and Greener Post-Quantum Cryptography on Emerging Embedded Platforms
... provide efficient public-key based solutions that can thwart ...post-quantum digital signature schemes: hash-based and lattice-based digital sig- ... See full document
23
LCPR: High Performance Compression Algorithm for Lattice-Based Signatures
... Lattice Signatures Digital signature schemes belong arguably to the most commonly used crypto- graphic primitives in practice with a wide range of ...Hence, digital signatures are ... See full document
31
Almost Fully Secure Lattice-based Group Signatures with Verifier-local Revocation
... Abstract: Efficient member revocation and strong security against attacks are prominent requirements in group signature ...and efficient method since it requires to inform only the verifiers regarding the ... See full document
28
Short Lattice-based One-out-of-Many Proofs and Applications to Ring Signatures
... of lattice-based cryptography, a promising candidate for post- quantum security, efficient designs targeting the same problems do not currently ...the lattice setting, and other approaches ... See full document
35
Improved Short Lattice Signatures in the Standard Model
... Lattice based cryptography [Ajt04, AD97], originally an area of primarily theoretical interest, has seen a tremendous growth during the last decade, due both to substantial efficiency improvements ... See full document
20
Large Graph Database for Subgraph Matching with Set Similarity Using String Metric Algorithm
... novel lattice-based index for data graph to efficiently process the SMS2 query, and lightweight signatures for both query and data ...an efficient two-phase pruning strategy based on ... See full document
5
Compact, Scalable, and Efficient Discrete Gaussian Samplers for Lattice-Based Cryptography
... communication, based on the hardness of factoring prime numbers (RSA) or the discrete logarithm problem ...proposed, lattice- based cryptography has emerged as an appealing candidate, due to its ... See full document
5
ModFalcon: compact signatures based on module NTRU lattices
... A caveat of Falcon comes from its complicated implementation, as its efficiency relies on several technical routines and the deep exploitation of the structures of the underlying mathematical objects. In particular, the ... See full document
27
Modular lattice signatures, revisited
... modular lattice signature scheme and its efficient instantiation known as ...modular lattice signature scheme can be based on a standard lattice ...a lattice vector with a ... See full document
32
Leakage-Resilient Lattice-Based Partially Blind Signatures
... now, lattice-based cryptography is one of the predominant approaches for constructing provably se- cure and efficient cryptographic primitives that can withstand attacks even by a quantum ...the ... See full document
35
Digital Signatures in the Legal Market:
... By using digital signatures, law firms and legal organizations increase the security of their electronic documents and the control they have over them. Long-term accountability is ensured by creating ... See full document
7
EdDSA Over Galois Field GF(p^m) for Multimedia Data
... The signature verification is the counterpart of the signature computation. Its purpose is to verify the message’s authenticity using the authenticator’s public key. In order to reduce frauds, signature verification is ... See full document
7
Synthesis of Fault Attacks on Cryptographic Implementations
... Embedded devices often play a central role in security architectures for large-scale software infras- tructures. For instance, they are used pervasively for purposes such as authentication, identity man- agement, and ... See full document
23
Related subjects