Lattice-based completely non-malleable PKE in the standard model

Authors:
Reza Sepahi;Ron Steinfeld;Josef Pieprzyk
Affiliations:
Department of Computing, Macquarie University, Sydney, Australia;Department of Computing, Macquarie University, Sydney, Australia;Department of Computing, Macquarie University, Sydney, Australia
Venue:
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Year:
2011

Citing 7
Cited 2

On lattices, learning with errors, random linear codes, and cryptography

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Lossy trapdoor functions and their applications

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Completely non-malleable encryption revisited

PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Efficient completely non-malleable public key encryption

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles

ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Completely non-malleable schemes

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient lattice (H)IBE in the standard model

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques

Revocable identity-based encryption from lattices

ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Lattice-based completely non-malleable public-key encryption in the standard model

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents ongoing work toward constructing efficient completely non-malleable public-key encryption scheme based on lattices in the standard (common reference string) model. An encryption scheme is completely non-malleable if it requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti proposed two inefficient constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Recently, two efficient public-key encryption schemes have been proposed, both of them are based on pairing identity-based encryption.