Author image not provided
 Vinod Vaikuntanathan

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article35.10
Citation Count2,422
Publication count69
Publication years2004-2017
Available for download19
Average downloads per article746.58
Downloads (cumulative)14,185
Downloads (12 Months)2,155
Downloads (6 Weeks)227
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


70 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 70
Result page: 1 2 3 4

Sort by:

1 published by ACM
June 2018 STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 20,   Downloads (12 Months): 89,   Downloads (Overall): 89

Full text available: PDFPDF
We study secret sharing schemes for general (non-threshold) access structures. A general secret sharing scheme for n parties is associated to a monotone function F :{0,1} n →{0,1}. In such a scheme, a dealer distributes shares of a secret s among n parties. Any subset of parties T ⊆ [ ...
Keywords: Information-Theoretic Cryptography, Secret Sharing

2 published by ACM
September 2017 ACM Transactions on Privacy and Security (TOPS): Volume 20 Issue 4, October 2017
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 19,   Downloads (12 Months): 158,   Downloads (Overall): 158

Full text available: PDFPDF
We develop two IND-CPA-secure multihop unidirectional Proxy Re-Encryption (PRE) schemes by applying the Ring-LWE (RLWE) key switching approach from the homomorphic encryption literature. Unidirectional PRE is ideal for secure publish-subscribe operations where a publisher encrypts information using a public key without knowing upfront who the subscriber will be and what ...
Keywords: software engineering, Proxy re-encryption, delegating access control, lattice encryption

3
March 2017 Proceedings, Part II, of the 20th IACR International Conference on Public-Key Cryptography --- PKC 2017 - Volume 10175
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We give three fully homomoprhic encryption FHE schemes that are secure against non-adaptive chosen ciphertext attacks CCA1. For the first two, we extend the generic transformation of Boneh, Canetti, Halevi and Katz to turn any multi-key identity-based FHE scheme into a CCA1-secure FHE scheme. We then show two instantiations of ...

4
March 2017 NSDI'17: Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 0

Many online services let users query public datasets such as maps, flight prices, or restaurant reviews. Unfortunately, the queries to these services reveal highly sensitive information that can compromise users' privacy. This paper presents Splinter, a system that protects users' queries on public data and scales to realistic applications. A ...

5
October 2016 Proceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 9985
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The notion of Zero Knowledge has driven the field of cryptography since its conception over thirty years ago. It is well established that two-message zero-knowledge protocols for NP do not exist, and that four-message zero-knowledge arguments exist under the minimal assumption of one-way functions. Resolving the precise round complexity of ...

6 published by ACM
October 2016 CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 20,   Downloads (12 Months): 267,   Downloads (Overall): 656

Full text available: PDFPDF
Motivated by the impossibility of achieving fairness in secure computation [Cleve, STOC 1986], recent works study a model of fairness in which an adversarial party that aborts on receiving output is forced to pay a mutually predefined monetary penalty to every other party that did not receive the output. These ...
Keywords: bitcoin, fairness, secure computation

7
September 2016 IEEE Transactions on Computers: Volume 65 Issue 9, September 2016
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 5

Homomorphic encryption (HE) systems enable computations on encrypted data, without decrypting and without knowledge of the secret key. In this work, we describe an optimized Ring Learning With Errors (RLWE) based implementation of a variant of the HE system recently proposed by Gentry, Sahai and Waters (GSW). Although this system ...

8
August 2016 Proceedings, Part III, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9816
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Fine-grained cryptographic primitives are ones that are secure against adversaries with an a-priori bounded polynomial amount of resources time, space or parallel-time, where the honest algorithms use less resources than the adversaries they are designed to fool. Such primitives were previously studied in the context of time-bounded adversaries Merkle, CACM ...

9
August 2016 Proceedings, Part III, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9816
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

We construct an LWE-based key-policy attribute-based encryption ABE scheme that supports attributes of unbounded polynomial length. Namely, the size of the public parameters is a fixed polynomial in the security parameter and a depth bound, and with these fixed length parameters, one can encrypt attributes of arbitrary length. Similarly, any ...

10 published by ACM
June 2016 STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 5,   Downloads (12 Months): 39,   Downloads (Overall): 174

Full text available: PDFPDF
A watermarking scheme for programs embeds some information called a mark into a program while preserving its functionality. No adversary can remove the mark without damaging the functionality of the program. In this work, we study the problem of watermarking various cryptographic programs such as pseudorandom function (PRF) evaluation, decryption, ...
Keywords: Watermarking, Indistinguishability obfuscation, Pseudorandom functions

11
March 2016 NSDI'16: Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 1

Modern web services rob users of low-level control over cloud storage--a user's single logical data set is scattered across multiple storage silos whose access controls are set by web services, not users. The consequence is that users lack the ultimate authority to determine how their data is shared with other ...

12 published by ACM
January 2016 ITCS '16: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 5,   Downloads (12 Months): 71,   Downloads (Overall): 352

Full text available: PDFPDF
We show how to securely obfuscate conjunctions , which are functions f ( x 1 ,..., x n ) = ∧ i ∈ I y i where I ⊆ [ n ] and each literal y i is either just x i or ¬ x i e.g., f ( x ...
Keywords: obfuscation

13 published by ACM
January 2016 ITCS '16: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 5,   Downloads (12 Months): 36,   Downloads (Overall): 133

Full text available: PDFPDF
Time-lock puzzles are a mechanism for sending messages "to the future". A sender can quickly generate a puzzle with a solution s that remains hidden until a moderately large amount of time t has elapsed. The solution s should be hidden from any adversary that runs in time significantly less ...
Keywords: proofs of work, time-lock puzzles, randomized encodings

14
January 2016 TCC 2016-A: Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We show general transformations from subexponentially-secure approximate indistinguishability obfuscation IO where the obfuscated circuit agrees with the original circuit on a $$1/2+\epsilon $$ fraction of inputs on a certain samplable distribution, into exact indistinguishability obfuscation where the obfuscated circuit and the original circuit agree on all inputs. As a step ...

15
January 2016 TCC 2016-A: Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The possibility of basing the security of cryptographic objects on the minimal assumption that $$ \mathbf{NP } \nsubseteq \mathbf{BPP } $$ is at the very heart of complexity-theoretic cryptography. Most known results along these lines are negative, showing that assuming widely believed complexity-theoretic conjectures, there are no reductions from an ...

16 published by ACM
December 2015 Journal of the ACM (JACM): Volume 62 Issue 6, December 2015
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 7,   Downloads (12 Months): 112,   Downloads (Overall): 616

Full text available: PDFPDF
In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an ℓ-bit public index ind and a message m , and a secret key is associated with a Boolean predicate P . The secret key allows decrypting the ciphertext and learning m if and only if P (ind) = ...
Keywords: Cryptography, attribute-based encryption, fine-grained access control, lattices, learning with errors

17
November 2015 Proceedings, Part I, of the 21st International Conference on Advances in Cryptology -- ASIACRYPT 2015 - Volume 9452
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We show a general connection between various types of statistical zero-knowledge SZK proof systems and unconditionally secure secret sharing schemes. Viewed through the SZK lens, we obtain several new results on secret-sharing:Characterizations: We obtain an almost-characterization of access structures for which there are secret-sharing schemes with an efficient sharing algorithm ...
Keywords: Secret sharing, Statistical zero knowledge

18
October 2015 FOCS '15: Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 5

Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to almost any known cryptographic object. So far, candidate IO constructions were based on specific assumptions on algebraic objects called multi-linear graded encodings. We present a generic construction of indistinguishability obfuscation from public-key functional encryption with succinct cipher ...

19 published by ACM
June 2015 STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 17
Downloads (6 Weeks): 5,   Downloads (12 Months): 26,   Downloads (Overall): 243

Full text available: PDFPDF
We show how to construct succinct Indistinguishability Obfuscation (IO) schemes for RAM programs. That is, given a RAM program whose computation requires space S and time T, we generate a RAM program with size and space requirements of ~O(S) and runtime ~O(T). The construction uses non-succinct IO (i.e., IO for ...
Keywords: garbling, indistinguishability obfuscation, punctured programming, ram programs

20 published by ACM
June 2015 STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 20
Downloads (6 Weeks): 12,   Downloads (12 Months): 56,   Downloads (Overall): 371

Full text available: PDFPDF
In a homomorphic signature scheme, a user Alice signs some large dataset x using her secret signing key and uploads the signed data to an untrusted remote server. The server can then run some computation y=f(x) over the signed data and homomorphically derive a short signature σ f,y certifying that ...
Keywords: sis, homomorphic signatures, lattices



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us