Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/795664.796435guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time

Published: 08 November 1998 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2011)A formalization of polytime functionsProceedings of the Second international conference on Interactive theorem proving10.5555/2033939.2033952(119-134)Online publication date: 22-Aug-2011
  • (2011)A higher-order characterization of probabilistic polynomial timeProceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis10.1007/978-3-642-32495-6_1(1-18)Online publication date: 19-May-2011
  • (2010)A calculus for game-based security proofsProceedings of the 4th international conference on Provable security10.5555/1927915.1927920(35-52)Online publication date: 13-Oct-2010
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science
November 1998
ISBN:0818691727

Publisher

IEEE Computer Society

United States

Publication History

Published: 08 November 1998

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2011)A formalization of polytime functionsProceedings of the Second international conference on Interactive theorem proving10.5555/2033939.2033952(119-134)Online publication date: 22-Aug-2011
  • (2011)A higher-order characterization of probabilistic polynomial timeProceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis10.1007/978-3-642-32495-6_1(1-18)Online publication date: 19-May-2011
  • (2010)A calculus for game-based security proofsProceedings of the 4th international conference on Provable security10.5555/1927915.1927920(35-52)Online publication date: 13-Oct-2010
  • (2009)CoSPProceedings of the 16th ACM conference on Computer and communications security10.1145/1653662.1653672(66-78)Online publication date: 9-Nov-2009
  • (2006)ACM SIGACT news distributed computing column 24ACM SIGACT News10.1145/1189056.118907437:4(58-84)Online publication date: 1-Dec-2006
  • (2006)Computationally sound secrecy proofs by mechanized flow analysisProceedings of the 13th ACM conference on Computer and communications security10.1145/1180405.1180450(370-379)Online publication date: 30-Oct-2006
  • (2006)Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security ProofElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.11.054155(111-145)Online publication date: 1-May-2006
  • (2006)Games and the impossibility of realizable ideal functionalityProceedings of the Third conference on Theory of Cryptography10.1007/11681878_19(360-379)Online publication date: 4-Mar-2006
  • (2005)Justifying a dolev-yao model under active attacksFoundations of Security Analysis and Design III10.5555/2137760.2137762(1-41)Online publication date: 1-Jan-2005
  • (2005)On the relationships between notions of simulation-based securityProceedings of the Second international conference on Theory of Cryptography10.1007/978-3-540-30576-7_26(476-494)Online publication date: 10-Feb-2005
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media