Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model

ISSN： 0933-2790

Source： Journal of Cryptology, Vol.17, Iss.1, 2004-01, pp. : 43-77

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimal Randomizer Efficiency in the Bounded-Storage Model

By Dziembowski Stefan

Journal of Cryptology, Vol. 17, Iss. 1, 2004-01 ,pp. : 5-26

Springer Publishing Company

Access to resources Recommend Favorite

Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors

By Lu Chi-Jen

Journal of Cryptology, Vol. 17, Iss. 1, 2004-01 ,pp. : 27-42

Springer Publishing Company

Access to resources Recommend Favorite

Constant-Round Oblivious Transfer in the Bounded Storage Model

By Ding Yan Zong

Journal of Cryptology, Vol. 20, Iss. 2, 2007-04 ,pp. : 165-202

Springer Publishing Company

Access to resources Recommend Favorite

The isomorphism problem for computable Abelian _p-groups of bounded length

The Journal of Symbolic Logic, Vol. 70, Iss. 1, 2005-03 ,pp. : 331-345

Cambridge University Press

Access to resources Recommend Favorite

Locally Finite Groups with Bounded Centralizer Chains

By Buturlakin A. Vasil’ev A.

Algebra and Logic, Vol. 52, Iss. 5, 2013-11 ,pp. : 367-370

Springer Publishing Company

Access to resources Recommend Favorite