Back to Results
First PageMeta Content
Malleability / Semantic security / Commitment scheme / Zero-knowledge proof / Chosen-ciphertext attack / Interactive proof system / RSA / Non-interactive zero-knowledge proof / Proof of knowledge / Cryptography / Cryptographic protocols / Ciphertext indistinguishability


Construction of a Non-Malleable Encryption Scheme from Any Semantically Secure One Rafael Pass1 , abhi shelat2 , and Vinod Vaikuntanathan3 1 Cornell University
Add to Reading List

Document Date: 2010-02-04 10:24:17


Open Document

File Size: 286,61 KB

Share Result on Facebook

Company

IBM / Designated Verifier NIZK Proof Systems / /

Currency

pence / /

Event

FDA Phase / Product Issues / Product Recall / /

Facility

Cornell University / /

IndustryTerm

Σ-protocols / Σ-protocol / deterministic polynomial-time algorithm / prover algorithm / p.p.t. algorithms / Σ-protocol prover algorithm / p.p.t. algorithm / /

Organization

MIT / Cornell University / /

Person

Blum Hamiltonicity / /

Position

CPA / /

Product

indistinguishability-based definition of secrecy / PA0 / Blu86 / Blum Hamiltonicity / P1 / CDS94 / /

Technology

Encryption / p.p.t. algorithms / one encryption / public key / Public-key Encryption / PKI / Σ-protocol prover algorithm / prover algorithm / gth encryption / given encryption / secret key / simulation / non-malleable encryption / deterministic polynomial-time algorithm / p.p.t. algorithm / Hamiltonicity protocol / four algorithms / 2.1 Semantically Secure Encryption / /

SocialTag