#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2012

2018

- This year (1)
- Last 5 years (6)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Rafael Pass, Karn Seth, Sidharth Telang
- CRYPTO
- 2014

We define a notion of semantic security of multilinear (a.k.a. graded) encoding schemes, which stipulates security of class of algebraic “decisional” assumptions: roughly speaking, we require that… (More)

- Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang
- STOC
- 2014

A randomized encoding allows to express a "complex" computation, given by a function f and input x, by a "simple to compute" randomized representation f(x) whose distribution encodes f(x), while… (More)

- Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang
- IACR Cryptology ePrint Archive
- 2016

It is well known that inefficient indistinguishability obfuscators (iO) with running time poly(|C|, λ) · 2, where C is the circuit to be obfuscated, λ is the security parameter, and n is the input… (More)

Traditional definitions of the security of encryption schemes assume that the messages encrypted are chosen independently of the randomness used by the encryption scheme. Recent works, implicitly by… (More)

- Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang
- IACR Cryptology ePrint Archive
- 2015

We consider randomized encodings (RE) that enable encoding a Turing machine Π and input x into its “randomized encoding” Π̂(x) in sublinear, or even polylogarithmic, time in the running-time of Π(x),… (More)

- Kai-Min Chung, Rafael Pass, Sidharth Telang
- IEEE 54th Annual Symposium on Foundations of…
- 2013

How can we encode a communication protocol between two parties to become resilient to adversarial errors on the communication channel? If we encode each message in the communication protocol with a… (More)

- Nir Bitansky, Ran Canetti, +6 authors Vinod Vaikuntanathan
- SIAM J. Comput.
- 2018

\bfA \bfb \bfs \bft \bfr \bfa \bfc \bft . We show how to construct indistinguishability obfuscation (\bfi \bfO ) for RAM programs with bounded space, assuming \bfi \bfO for circuits and one-way… (More)

- Kai-Min Chung, Rafael Pass, Sidharth Telang
- IACR Cryptology ePrint Archive
- 2013

How can we encode a communication protocol between two parties to become resilient to adversarial errors on the communication channel? This question dates back to the seminal works of Shannon and… (More)

- Sidharth Telang
- 2016

Important Disclaimer: Problems 2 and 3 are very similar. I (Daniele) solved only one of them, and it has a relatively simple solution, definitely fair as a homework assignment for this class. So, for… (More)

- Raghav Bhaskar, Ragesh Jaiswal, Sidharth Telang
- WISEC
- 2012

In-network aggregation is a technique employed in Wireless Sensor Networks (WSNs) to aggregate information flowing from the sensor nodes towards the base station. It helps in reducing the… (More)