Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs

ISSN： 0933-2790

Source： Journal of Cryptology, Vol.21, Iss.3, 2008-07, pp. : 303-349

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

An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes

By Gault Richard L.

Theory of Computing Systems, Vol. 39, Iss. 5, 2006-09 ,pp. : 753-783

Springer Publishing Company

Access to resources Recommend Favorite

Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring

By Coron Jean-Sebastien

Journal of Cryptology, Vol. 20, Iss. 1, 2007-01 ,pp. : 39-50

Springer Publishing Company

Access to resources Recommend Favorite

Every polynomial-time 1-degree collapses if and only if P = PSPACE

The Journal of Symbolic Logic, Vol. 69, Iss. 3, 2004-09 ,pp. : 713-741

Cambridge University Press

Access to resources Recommend Favorite

Formal Proofs for the Security of Signcryption

By Baek Joonsang

Journal of Cryptology, Vol. 20, Iss. 2, 2007-04 ,pp. : 203-235

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial size proofs of the propositional pigeonhole principle

The Journal of Symbolic Logic, Vol. 52, Iss. 4, 1987-12 ,pp. : 916-927

Cambridge University Press

Access to resources Recommend Favorite