Skip to search formSkip to main contentSkip to account menu
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
TLDR
This work shows how to modify NTRUEncrypt to make it provably secure in the standard model, under the assumed quantum hardness of standard worst-case lattice problems, restricted to a family of lattices related to some cyclotomic fields.
View via Publisher
Universal Designated-Verifier Signatures
TLDR
A new type of signature scheme called a ‘Universal Designated-Verifier Signature’ (UDVS) can function as a standard publicly-verifiable digital signature but has additional functionality which allows any holder of a signature to designate the signature to any desired designated-verifier (using the verifier’s public key).
View via Publisher
Formal Proofs for the Security of Signcryption
TLDR
This paper proposes realistic security models for signcryption, which give the attacker power to choose both messages/signcryptexts as well as recipient/sender public keys when accessing the signc encryption/unsigncryption oracles of attacked entities.
View on Springer
Content Extraction Signatures
TLDR
This work defines a new type of digital signature called a 'Content Extraction Signature' (CES), and proposes and analyzes four provably secure CES constructions which satisfy desirable functional and security requirements.
View via Publisher
Faster Fully Homomorphic Encryption
TLDR
Two improvements to Gentry’s fully homomorphic scheme based on ideal lattices are described: a more aggressive analysis of one of the hardness assumptions and a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree.
View via Publisher
VSH, an Efficient and Provable Collision Resistant Hash Function
We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of very smooth numbers modulo an…
View via Publisher
GGHLite: More Efficient Multilinear Maps from Ideal Lattices
TLDR
The main contributions are to formalize, simplify and improve the efficiency and the security analysis of the re-randomization process in the GGH construction, which results in a new construction that is called GGHLite.
View via Publisher
Result Pattern Hiding Searchable Encryption for Conjunctive Queries
TLDR
This paper proposes a new SSE protocol, called Hidden Cross-Tags (HXT), that removes 'Keyword Pair Result Pattern' (KPRP) leakage for conjunctive keyword search, and proposes a 'lightweight' HVE scheme that only uses efficient symmetric-key building blocks, and entirely avoids elliptic curve-based operations.
View on ACM
Efficient Public Key Encryption Based on Ideal Lattices
TLDR
This work achieves CPA-security against subexponential attacks, with (quasi-)optimal asymptotic performance, in public key encryption schemes with security provably based on the worst case hardness of the approximate Shortest Vector Problem in some structured lattices, called ideal lattices.
View via Publisher
A Signcryption Scheme Based on Integer Factorization
TLDR
It is proved that the proposed new signcryption scheme is existentially unforgeable, in the random oracle model, subject to the assumption that factoring an RSA modulus N = pq (with p and q prime) is hard even when given the additional pair (g; S).
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License