dbo:abstract |
In cryptography, concrete security or exact security is a practice-oriented approach that aims to give more precise estimates of the computational complexities of adversarial tasks than polynomial equivalence would allow. It quantifies the security of a cryptosystem by bounding the probability of success for an adversary running for a fixed amount of time. Security proofs with precise analyses are referred to as concrete. Traditionally, provable security is asymptotic: it classifies the hardness of computational problems using polynomial-time reducibility. Secure schemes are defined to be those in which the advantage of any computationally bounded adversary is negligible. While such a theoretical guarantee is important, in practice one needs to know exactly how efficient a reduction is because of the need to instantiate the security parameter - it is not enough to know that "sufficiently large" security parameters will do. An inefficient reduction results either in the success probability for the adversary or the resource requirement of the scheme being greater than desired. Concrete security parametrizes all the resources available to the adversary, such as running time and memory, and other resources specific to the system in question, such as the number of plaintexts it can obtain or the number of queries it can make to any oracles available. Then the advantage of the adversary is upper bounded as a function of these resources and of the problem size. It is often possible to give a lower bound (i.e. an adversarial strategy) matching the upper bound, hence the name exact security. (en) |
dbo:wikiPageExternalLink |
https://www.baigneres.net/downloads/2007_provable_security.pdf https://crypto.stanford.edu/~dabo/cryptobook/draft_0_3.pdf https://www.cs.purdue.edu/homes/jblocki/courses/555_Fall18/slides/Week2.pdf https://eprint.iacr.org/2020/1213.pdf |
dbo:wikiPageID |
2288644 (xsd:integer) |
dbo:wikiPageLength |
6388 (xsd:nonNegativeInteger) |
dbo:wikiPageRevisionID |
1123571019 (xsd:integer) |
dbo:wikiPageWikiLink |
dbr:Block_cipher_mode_of_operation dbr:Pseudorandom_generator dbr:Security_parameter dbc:Cryptography dbr:Coq dbr:Cryptography dbr:Computationally_bounded_adversary dbr:Lattice-based_cryptography dbr:Polynomial-time_reduction dbr:Formal_verification dbr:Digital_signature dbr:Probability dbr:Provable_security dbr:Rabin_cryptosystem dbr:Adversary_(cryptography) dbc:Theory_of_cryptography dbr:ElGamal_encryption dbr:RSA_(cryptosystem) dbr:Oracle_attack dbr:Symmetric_encryption dbr:NC0 dbr:Security_proof dbr:Negligible_function_(cryptography) |
dbp:wikiPageUsesTemplate |
dbt:Better_source_needed dbt:Citation_needed dbt:Clarify dbt:More_citations_needed dbt:Multiple_issues dbt:Primary_sources dbt:Reflist dbt:Technical dbt:Crypto-stub |
dcterms:subject |
dbc:Cryptography dbc:Theory_of_cryptography |
gold:hypernym |
dbr:Approach |
rdf:type |
dbo:ProgrammingLanguage |
rdfs:comment |
In cryptography, concrete security or exact security is a practice-oriented approach that aims to give more precise estimates of the computational complexities of adversarial tasks than polynomial equivalence would allow. It quantifies the security of a cryptosystem by bounding the probability of success for an adversary running for a fixed amount of time. Security proofs with precise analyses are referred to as concrete. (en) |
rdfs:label |
Concrete security (en) |
owl:sameAs |
freebase:Concrete security wikidata:Concrete security https://global.dbpedia.org/id/4hpfe |
prov:wasDerivedFrom |
wikipedia-en:Concrete_security?oldid=1123571019&ns=0 |
foaf:isPrimaryTopicOf |
wikipedia-en:Concrete_security |
is dbo:wikiPageRedirects of |
dbr:Asymptotic_security dbr:Concrete_security_model |
is dbo:wikiPageWikiLink of |
dbr:Index_of_cryptography_articles dbr:CryptoVerif dbr:Commitment_scheme dbr:Galois/Counter_Mode dbr:Provable_security dbr:Advantage_(cryptography) dbr:Phillip_Rogaway dbr:Negligible_function dbr:Asymptotic_security dbr:Concrete_security_model |
is foaf:primaryTopic of |
wikipedia-en:Concrete_security |