Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CRYPTO
2008
Springer

favoriteEmaildiscussreport

109views Cryptology» more CRYPTO 2008»

Adaptive One-Way Functions and Applications

13 years 6 months ago

Adaptive One-Way Functions and Applications

Download www.cs.cornell.edu

Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than traditional cryptographic hardness assumptions; however, assuming their validity we can resolve a number of long-standing open problems in cryptography. Keywords. Cryptographic Assumptions, Non-malleable Commitment, Non-malleable Zero-knowledge

Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan

Real-time Traffic

Complexity Theoretic Hardumptions | CRYPTO 2008 | Cryptographic Assumptions | Cryptographic Hardness Assumptions | Cryptology |

claim paper

Related Content

» A Cellular Automaton Based Fast OneWay Hash Function Suitable for Hardware Implementation

» VMPC OneWay Function and Stream Cipher

» Foundations of Nonmalleable Hash and OneWay Functions

» Weighted OneWay Hash Chain and Its Applications

» UnboundedError OneWay Classical and Quantum Communication Complexity

» Using OneWay Chains to Provide Message Authentication without Shared Secrets

» Two Is a Crowd A BlackBox Separation of OneWayness and Security under Correlated Inputs

» Limitations of Quantum Advice and OneWay Communication

» An adaptivePCA algorithm for reflectance estimation from color images

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	CRYPTO
Authors	Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan

Comments (0)