Back to Results
First PageMeta Content
Chosen-ciphertext attack / Ciphertext / RSA / Adaptive chosen-ciphertext attack / Advantage / Paillier cryptosystem / Affine cipher / Cryptography / Homomorphic encryption / Chosen-plaintext attack


DoubleMod and SingleMod: Simple Randomized Secret-Key Encryption with Bounded Homomorphicity Dhananjay S. Phatak,∗ Qiang Tang,† Alan T. Sherman,∗ Warren D. Smith,‡ Peter Ryan,† Kostas Kalpakis∗ April[removed]re
Add to Reading List

Document Date: 2014-08-26 15:05:13


Open Document

File Size: 187,92 KB

Share Result on Facebook

City

Baltimore / /

Company

Residue Number Systems / /

Country

United States / Luxembourg / /

/

Facility

University of Luxemborg / University of Maryland / /

IndustryTerm

elliptic curve groups / secure homomorphic systems / search takes / oblivious data processing / oblivious processing / homomorphic encryption systems / homomorphic systems / binary search / randomized encryption systems / information-processing analogue / search interval / randomized secret-key encryption systems / cryptographic voting systems / public-key encryption systems / encryption systems / computing / cloud computing / exhaustive search / integer homomorphic systems / untrusted data processing entities / lattice algorithms / linear search / /

Organization

CSEE Department / University of Luxemborg / University of Maryland / Baltimore County / Computer Science and Communications Research Unit / Cyber Defense Lab / /

Person

Alan T. Sherman / Kalai / Warren D. Smith / ‡ Peter / Qiang Tang / † Alan / Next / Peter Ryan / Van Dijk / Phatak / /

Position

IND-CPA / CPA / feed-forward / /

Product

DoubleMod / /

ProvinceOrState

Maryland / Baltimore County / /

TVShow

Q.E.D. 4 / /

Technology

Encryption / cryptography / lattice algorithms / Operations Homomorphic encryption / secret key / simulation / separate encryptions / 2 Homomorphic Encryption / /

SocialTag