NDLI: Targeted malleability: homomorphic encryption for restricted computations

Please wait, while we are loading the content...

High-confidence predictions under adversarial uncertainty

Learning hurdles for sleeping experts

Restriction access

Mechanism design with approximate valuations

Quantum strategic game theory

The curse of simultaneity

No justified complaints: on fair sharing of multiple resources

From randomizing polynomials to parallel algorithms

Practical verified computation with streaming interactive proofs

Paging for multi-core shared caches

Noise vs computational intractability in dynamics

Distribution free evolvability of polynomial functions over all convex loss functions

Algorithms on evolving graphs

Towards deterministic tree code constructions

Linear time decoding of regular expander codes

List decoding subspace codes from insertions and deletions

Bounds on locally testable codes with unique tests

Approximately optimal mechanism design via differential privacy

Fairness through awareness

Dynamics of prisoner's dilemma and the evolution of cooperation on networks

Crowdsourced Bayesian auctions

Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure

Quantum interactive proofs with weak error bounds

Quantum money from knots

Quantum rejection sampling

(Leveled) fully homomorphic encryption without bootstrapping

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

Targeted malleability: homomorphic encryption for restricted computations

Sherali-Adams relaxations and indistinguishability in counting logics

Graph densification

Spectral sparsification via random spanners

Multicommodity flows and cuts in polymatroidal networks

On the degree of univariate polynomials over the integers

On persistent homotopy, knotted complexes and the Alexander module

Compressed matrix multiplication

Gadgets and anti-gadgets leading to a complexity dichotomy

On beating the hybrid argument

Linear programming, width-1 CSPs, and robust satisfaction

Marginal hitting sets imply super-polynomial lower bounds for permanent

Targeted malleability: homomorphic encryption for restricted computations

Content Provider	ACM Digital Library
Author	Segev, Gil Boneh, Dan Waters, Brent
Abstract	We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perform on encrypted data. We introduce a precise framework, generalizing the foundational notion of non-malleability introduced by Dolev, Dwork, and Naor (SICOMP '00), ensuring that the malleability of a scheme is targeted only at a specific set of "allowable" functions. In this setting we are mainly interested in the efficiency of such schemes as a function of the number of repeated homomorphic operations. Whereas constructing a scheme whose ciphertext grows linearly with the number of such operations is straightforward, obtaining more realistic (or merely non-trivial) length guarantees is significantly more challenging. We present two constructions that transform any homomorphic encryption scheme into one that offers targeted malleability. Our constructions rely on standard cryptographic tools and on succinct non-interactive arguments, which are currently known to exist in the standard model based on variants of the knowledge-of-exponent assumption. The two constructions offer somewhat different efficiency guarantees, each of which may be preferable depending on the underlying building blocks.
Starting Page	350
Ending Page	366
Page Count	17
File Format	PDF
ISBN	9781450311151
DOI	10.1145/2090236.2090264
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-01-08
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Non-malleable encryption Homomorphic encryption
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Targeted malleability: homomorphic encryption for restricted computations (2011).

Construction of a non-malleable encryption scheme from any semantically secure one (2006)

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

Efficient Construction of Completely Non-Malleable CCA Secure Public Key Encryption

Textbook non-malleable commitments

Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures

Non-malleability from malleability: Simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures (2014)

An algebraic approach to non-malleability.

Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures

Targeted malleability: homomorphic encryption for restricted computations

Similar Documents

Targeted malleability: homomorphic encryption for restricted computations (2011).

Construction of a non-malleable encryption scheme from any semantically secure one (2006)

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

Efficient Construction of Completely Non-Malleable CCA Secure Public Key Encryption

Textbook non-malleable commitments

Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures

Non-malleability from malleability: Simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures (2014)

An algebraic approach to non-malleability.

Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures

Targeted malleability: homomorphic encryption for restricted computations