#### Filter Results:

- Full text PDF available (75)

#### Publication Year

2000

2017

- This year (4)
- Last 5 years (31)
- Last 10 years (57)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Abhishek Banerjee, Chris Peikert, Alon Rosen
- IACR Cryptology ePrint Archive
- 2011

We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically efficient and highly parallelizable in a practical sense, i.e., they can be computed by simple, relatively small low-depth arithmetic or boolean circuits (e.g., in NC or even TC). In… (More)

- Manoj Prabhakaran, Alon Rosen, Amit Sahai
- FOCS
- 2002

We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using Õ(log n) rounds of interaction. The number of rounds in our protocol is optimal, in the sense that any language outside BPP requires at least Ω̃(log n) rounds of interaction in order to be proved in black-box concurrent zero-knowledge. The zeroknowledge property… (More)

- Rafael Pass, Alon Rosen
- STOC
- 2005

We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitments. Our constructions rely on the existence of (standard) collision resistant hash functions. Previous constructions either relied on the existence of trapdoor permutations and… (More)

We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique underlying our functions is a novel use of the Fast Fourier Transform (FFT) to achieve “diffusion,” together with a linear combination to achieve compression and “confusion.” We… (More)

- Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel
- Journal of Cryptology
- 2004

We present the first constant-round protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties stores only a small portion of R. Even though the portions stored by the honest parties are small, security is guaranteed against any malicious party that remembers… (More)

- Yaping Li, Hongyi Yao, Minghua Chen, Sidharth Jaggi, Alon Rosen
- INFOCOM
- 2010

By allowing routers to randomly mix the information content in packets before forwarding them, network coding can maximize network throughput in a distributed manner with low complexity. However, such mixing also renders the transmission vulnerable to pollution attacks, where a malicious node injects corrupted packets into the information flow. In a worst… (More)

- Alon Rosen, Gil Segev
- IACR Cryptology ePrint Archive
- 2008

We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs (x1, . . . , xk), so that the function (f(x1), . . . , f(xk)) is one-way. The main motivation of this study is the construction of public-key encryption schemes that are secure… (More)

- Rafael Pass, Alon Rosen
- 46th Annual IEEE Symposium on Foundations of…
- 2005

We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a man-in-the-middle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender and as a receiver cannot make the values he commits to depend on… (More)

- David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev
- Journal of Cryptology
- 2009

We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters in STOC’08, pp. 187–196, 2008), and correlation-secure trapdoor functions (Rosen and Segev in TCC’09, LNCS, vol. 5444, pp. 419–436, 2009). Our constructions widen the set of number-theoretic assumptions upon which these primitives can be based, and are summarized as… (More)

- Chris Peikert, Alon Rosen
- Electronic Colloquium on Computational Complexity
- 2005

The generalized knapsack function is defined as fa(x) = P i ai · xi, where a = (a1, . . . , am) consists of m elements from some ring R, and x = (x1, . . . , xm) consists of m coefficients from a specified subset S ⊆ R. Micciancio (FOCS 2002) proposed a specific choice of the ring R and subset S for which inverting this function (for random a,x) is at least… (More)