Efficiency Bounds for Adversary Constructions in Black-Box Reductions (Q3634498): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Provably Secure Time-Stamping Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the efficiency of encryption and digital signature schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Efficiency of Generic Cryptographic Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Software Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities / rank
 
Normal rank

Latest revision as of 17:41, 1 July 2024

scientific article
Language Label Description Also known as
English
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
scientific article

    Statements

    Identifiers