[PDF] Top 20 Transcript secure signatures based on modular lattices
Has 10000 "Transcript secure signatures based on modular lattices" found on our website. Below are the top 20 most common "Transcript secure signatures based on modular lattices".
Transcript secure signatures based on modular lattices
... schemes based on modular properties of the coordinates of lattice ...schemes transcript secure via a rejection sampling technique of Lyubashevsky ...version) based on the performance of ... See full document
21
Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-based
... Group signatures [CvH91] have been an active research topic in public-key ...group signatures to find applications in various real-life scenarios, such as digital right management, anonymous online ... See full document
26
Tightly-Secure Signatures From Lossy Identification Schemes
... log based scheme of Girault et ...is based on the worst-case hardness of the shortest vector problem in ideal ...is based directly on the hardness of the Subset Sum ... See full document
24
A Provably Secure Variant of ETRU Based on Extended Ideal Lattices Over Direct Product of Dedekind Domains
... provably secure encryption ...ring signatures, identity-based schemes, homomorphic encryption, zero-knowledge proofs, and identification protocols over direct product of rings and extended ideal ... See full document
22
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 schemes. Among the revocation approaches Verifier-local revocation is the most flexible and ... See full document
28
Improved Short Lattice Signatures in the Standard Model
... provably secure in the standard model (no random oracles) based on the worst-case complexity of approximating the Shortest Vector Problem in ideal lattices within polynomial ...short ... See full document
20
Asymptotically Efficient Lattice-Based Digital Signatures
... one-time signatures. Our generic construction can be instantiated based on both general and ideal ...cyclic) lattices, and the resulting signature schemes are provably secure based on ... See full document
25
Constant-size Group Signatures from Lattices
... group signatures, the user first encrypts his public key p to ciphertext c via a CCA-secure encryption scheme obtained by applying the Naor-Yung transformation [51] to a variant of the RL- WE-based ... See full document
36
Leveled Fully Homomorphic Signatures from Standard Lattices
... homomorphic signatures based on SNARKs in the Random-Oracle model (see ...is secure but, since the construction of SNARKs is complex and involves heavy PCP machinery, this assumptions would be far ... See full document
39
Adaptively Secure Fully Homomorphic Signatures Based on Lattices
... We propose several adaptive security models for homomorphic signatures. The strongest, EUF-FH-CMA, differs from the weakest, EUF-FH-CDA, in that the strict model (EUF-FH-CMA) allows fully adaptive queries at the ... See full document
25
ModFalcon: compact signatures based on module NTRU lattices
... Lattice reduction attacks As is now standard in lattice-based cryptography, we fol- low the core SVP hardness methodology put forward in [ADPS16]. The attack is viewed as an instance of a lattice problem, which is ... See full document
27
Improved ID-based Ring Signature Scheme with Constant-size Signatures
... schemes based on the notion of ac- cumulator with one-way domain, an extension of crypto- graphic ...accumulator based on bilinear pairings to design ID- based ad-hoc anonymous identification schemes ... See full document
8
Forward Secure Signatures on Smart Cards
... In 1997 Anderson introduced the idea of forward secure signature schemes (FSS) [And97]. The idea behind FSS is the following: Even in the case of a key compromise, all signatures issued before the ... See full document
19
Fully Secure and Fast Signing from Obfuscation
... algorithm chooses a puncturable PRF key at random. A message is signed by evaluating the puncturable PRF on it. The verification key is an indistinguishability obfuscation that on input a message and signature pair, ... See full document
25
Secure Data Sharing With Linkable Ring Signatures
... ABSTRACT: Data distribution is not easier with the use of cloud computing, and an exact analysis on the shared data provides more profit to both the world and individuals. Data distribution with a large number of ... See full document
6
The Minimal System of Defining Relations of the Free Modular Lattice of Rank 3 and Lattices Close to Modular One
... free modular lattice of rank ...not modular. In light of this theorem there is natural interest in lattices generated by a, b, c subject to one or another subset σ of the defining relations from the ... See full document
5
A SURVEY ON ELLIPTIC CURVE DIGITAL SIGNATURE ALGORITHM AND ITS VARIANTS
... The Elliptic Curve Digital Signature Algorithm (ECDSA) is an elliptic curve variant of the Digital Signature Algorithm (DSA). It gives cryptographically strong digital signatures making use of Elliptic curve ... See full document
16
Dynamical Process on Growing Geometrical Network Based on Modular Group
... Then, we compute the GMFPT of every other iteration from the modular group. Figure 5 shows a semi-log plot between GMFPT and iterations and it shows that GMFPT grows ex- ponentially. This trend indicates that it ... See full document
9
Scheme for Secure Communication via Information Hiding Based on Key Exchange and Decomposition Protocols
... for secure commu- nication via open network ...is based on Gaussian arithmetic with complex modulus and another on an elliptic curve modular ... See full document
5
Improved (Almost) Tightly-Secure Structure-Preserving Signatures
... hence our scheme is structure-preserving and simultaneously (almost) tightly- secure. The strategy of obtaining SPS from split-CRS QA-NIZK for affine lan- guages was first used in [JR17], but that scheme incurred ... See full document
30
Related subjects