The black-box model for cryptographic primitives

DOI10.1007/S001459900039MaRDI QIDQ1126893zbMATH OpenOpenAlexWikidataFDO

Authors Claus Peter Schnorr, Serge Vaudenay

Publication date 25 October 1999

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001459900039

zbMATH Keywords

lower boundscryptographic primitivesgeneric attackscomputation graph

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1088902
• Black-box models of computation in cryptology.
• Black-Box Property of Cryptographic Hash Functions
• Cryptography and Coding

Cited in

(6)

• On black-box complexity of universally composable security in the CRS model
• Black-Box Property of Cryptographic Hash Functions
• On Black-Box Complexity of Universally Composable Security in the CRS Model
• Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
• CS-Cipher
• Information Security and Privacy

This page was built for publication: The black-box model for cryptographic primitives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126893)