Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Public Key Cryptography
Subscribe
Academic
Publications
Publickey cryptography from different assumptions
Publickey cryptography from different assumptions,10.1145/1806689.1806714,Benny Applebaum,Boaz Barak,Avi Wigderson
Edit
Publickey cryptography from different assumptions
(
Citations: 5
)
BibTex

RIS

RefWorks
Download
Benny Applebaum
,
Boaz Barak
,
Avi Wigderson
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 171180, 2010
DOI:
10.1145/1806689.1806714
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.informatik.unitrier.de
)
(
doi.acm.org
)
Citation Context
(3)
...Applebaum, Barak, and Wigderson [
2
] prove that, when based on dparity blowup predicates, the output of Goldreich’s function is pseudorandom against linear functions, lowdegree polynomials, and constantdepth circuits...
...Applebaum, Barak, and Wigderson [
2
] showed that the output of Goldreich’s function based on such predicates is pseudorandom against linear functions, lowdegree polynomials, and constantdepth circuits...
Andrej Bogdanov
,
et al.
Input Locality and Hardness Amplification
...In particular, generalizing our proposal to functions with m = O(n) output bits (rather than n output bits), Bogdanov and Qiao showed [6] that a necessary requirement for security is using a balanaced predicate P (i.e., P such that {z ∈{ 0, 1} � : P (z )=1 } =2 � −1 ). The use of balanaced predicates is also advocated in [
1
,7]...
Oded Goldreich
.
Candidate OneWay Functions Based on Expander Graphs
...This was proposed by Applebaum, Barak and Wigderson [
5
] as a suitable choice of f following some earlier attacks on Goldreich’s generator for “structured” f ’s (Bogdanov and Qiao [9])...
...Applebaum et al. [
5
] proposed the“DSF assumption” and showed how to use it (with other assumptions) to build publickey cryptosystems...
...When m = n this is conjectured by Goldreich [12], but in [
5
] m is required to be superlinear...
Sanjeev Arora
,
et al.
New Algorithms for Learning in Presence of Errors
Sort by:
Citations
(5)
Computational complexity and information asymmetry in financial products
(
Citations: 8
)
Sanjeev Arora
,
Boaz Barak
,
Markus Brunnermeier
,
Rong Ge
Journal:
Communications of The ACM  CACM
, vol. 54, no. 5, pp. 101107, 2011
Approximation Algorithms for Union and Intersection Covering Problems
Marek Cygan
,
Fabrizio Grandoni
,
Stefano Leonardi
,
Marcin Mucha
,
Marcin Pilipczuk
,
Piotr Sankowski
Journal:
Computing Research Repository  CORR
, vol. abs/1102.5, 2011
Input Locality and Hardness Amplification
Andrej Bogdanov
,
Alon Rosen
Conference:
Theory of Cryptography
, pp. 118, 2011
Candidate OneWay Functions Based on Expander Graphs
(
Citations: 37
)
Oded Goldreich
Journal:
Electronic Colloquium on Computational Complexity  ECCC
, vol. 7, no. 90, 2000
New Algorithms for Learning in Presence of Errors
(
Citations: 1
)
Sanjeev Arora
,
Rong Ge