Browsing by Advisor "Kanukurthi, Bhavana"
Now showing items 1-7 of 7
-
Constant-rate Non-malleable Codes and their Applications
Non-malleable codes(NMC) introduced by Dziembowski, Pietrzak and Wichs in ITCS 2010, provide powerful security guarantees where error-correcting codes can not provide any guarantee: a decoding of tampered codeword is ... -
Enhancing Privacy and Efficiency of Distributed Encryption
The primary objective of a distributed system is to eliminate reliance on a central authority. In a distributed encryption scheme, users should be able to generate their key materials independently while securely sharing ... -
Locally Reconstructable Non-malleable Secret Sharing
Non-malleable secret sharing (NMSS) schemes, introduced by Goyal and Kumar (STOC 2018), ensure that a secret m can be distributed into shares m1,...,mn (for some n), such that any t (a parameter <= n) shares can be ... -
Near Optimal Non-malleable Codes and Leakage Resilient Secret Sharing Schemes
A well-studied class of attacks on cryptosystems called "side-channel attacks", stems from the additional access that an adversary can get due to the susceptibility of the hardware on which the cryptosystem (e.g., digital ... -
Rational Secure Computation: New Definitions and Constructions
Cryptography and Game Theory are two fascinating areas of modern computing, and there have been numerous works since the early 2000s to bridge these. While cryptography provides mechanisms to detect deviations, game theory ... -
Secure Auctions with Rational Parties
Sealed bid auctions are used to allocate a resource among a set of interested parties. Traditionally, auctions need the presence of a trusted auctioneer to whom the bidders provide their private bid values. Existence of ... -
Secure Vickrey Auctions with Rational Parties
In this work, we construct a second price (Vickrey) auction protocol (SPA), which does not require any auctioneers and ensures total privacy in the presence of rational parties participating in the auction. In particular, ...