About: Concrete security

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Concrete security Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:ProgrammingLanguage, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FConcrete_security

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.

Attributes	Values
rdf:type	programming language
rdfs:label	Concrete security (en)
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)
dcterms:subject	Cryptography Theory of cryptography
Wikipage page ID	2288644 (xsd:integer)
Wikipage revision ID	1123571019 (xsd:integer)
Link from a Wikipage to another Wikipage	Block cipher mode of operation Pseudorandom generator Security parameter Cryptography Coq Cryptography Computationally bounded adversary Lattice-based cryptography Polynomial-time reduction Formal verification Digital signature Probability Provable security Rabin cryptosystem Adversary (cryptography) Theory of cryptography ElGamal encryption RSA (cryptosystem) Oracle attack Symmetric encryption NC0 Security proof Negligible function (cryptography)
Link from a Wikipage to an external page	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
sameAs	Concrete security Concrete security Concrete security
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
has 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)
gold:hypernym	Approach
prov:wasDerivedFrom	wikipedia-en:Concrete_security?oldid=1123571019&ns=0
page length (characters) of wiki page	6388 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Concrete_security
is Link from a Wikipage to another Wikipage of	Index of cryptography articles CryptoVerif Commitment scheme Galois/Counter Mode Provable security Advantage (cryptography) Phillip Rogaway Negligible function Asymptotic security Concrete security model
is Wikipage redirect of	Asymptotic security Concrete security model
is foaf:primaryTopic of	wikipedia-en:Concrete_security

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 44 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software