Predicative Recursion and Computational Complexity (1992)

View PDF

Download Links

by Stephen J. Bellantoni
Citations:47 - 3 self

Documents Related by Co-Citation

191 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
828 A calculus for cryptographic protocols: The spi calculus – Martin Abadi, Andrew D. Gordon - 1999
22 Predicative recursion and the polytime hierarchy – S Bellantoni - 1995
1132 On the Security of Public Key Protocols – Danny Dolev, et al. - 1983
670 Universally composable security: A new paradigm for cryptographic protocols – Ran Canetti - 2013
2966 New Directions in Cryptography – Whitfield Diffie, Martin E. Hellman - 1976
482 A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack – Ronald Cramer, Victor Shoup - 1998
472 Relations among notions of security for public-key encryption schemes – Mihir Bellare, David Pointcheval, Phillip Rogaway - 1998
766 Notions of Computation and Monads – Eugenio Moggi - 1991