Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CRYPTO
2006
Springer

favoriteEmaildiscussreport

109views Cryptology» more CRYPTO 2006»

Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One

13 years 8 months ago

Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One

Download www.cs.cornell.edu

There are several candidate semantically secure encryption schemes, yet in many applications non-malleability of encryptions is crucial. We show how to transform any semantically secure encryption scheme into one that is non-malleable for arbitrarily many messages. Keywords. Public-key Encryption, Semantic Security, Non-malleability, Noninteractive Zero-knowledge Proofs.

Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan

Real-time Traffic

CRYPTO 2006 | Cryptology | Noninteractive Zero-knowledge Proofs | Secure Encryption Scheme | Semantically Secure |

claim paper

Related Content

» NonMalleable NonInteractive Zero Knowledge and Adaptive ChosenCiphertext Security

» Construction of Threshold PublicKey Encryptions through TagBased Encryptions

» ChosenCiphertext Security from IdentityBased Encryption

» Functional Encryption with Bounded Collusions via Multiparty Computation

» Improved Noncommitting Encryption Schemes Based on a General Complexity Assumption

» Predicate Encryption with Partial Public Keys

» ChosenCiphertext Security of Multiple Encryption

» PublicKey Cryptography from New Multivariate Quadratic Assumptions

» Securing Computation against Continuous Leakage

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CRYPTO
Authors	Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan

Comments (0)