Plain Model Cryptography refers to cryptographic schemes whose security proofs are based directly on standard cryptographic assumptions without requiring idealized assumptions about components like random oracles. This approach provides a higher degree of theoretical security assurance because it avoids relying on abstract, non-realizable constructs. It aims for proofs of security that hold in the real world.
Context
The debate between plain model cryptography and schemes relying on random oracle models is a recurring theme in cryptographic research, with implications for the foundational security of blockchain protocols. While random oracle models can simplify proofs, plain model proofs are generally considered more robust against future attacks. Advances in zero-knowledge proofs often seek plain model security guarantees to bolster trust.
The first complexity-preserving SNARK in the plain model eliminates expensive setup, enabling efficient, publicly verifiable, and composable computation.
We use cookies to personalize content and marketing, and to analyze our traffic. This helps us maintain the quality of our free resources. manage your preferences below.
Detailed Cookie Preferences
This helps support our free resources through personalized marketing efforts and promotions.
Analytics cookies help us understand how visitors interact with our website, improving user experience and website performance.
Personalization cookies enable us to customize the content and features of our site based on your interactions, offering a more tailored experience.
