Secure information hiding based on computationally intractable problems (Q4440673): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4415039 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4298260 / rank | |||
Normal rank | |||
Latest revision as of 13:30, 6 June 2024
scientific article; zbMATH DE number 2019968
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Secure information hiding based on computationally intractable problems |
scientific article; zbMATH DE number 2019968 |
Statements
Secure information hiding based on computationally intractable problems (English)
0 references
2003
0 references
3-coloring problem
0 references
signatures
0 references
cryptography
0 references
data hiding
0 references
zero knowledge interactive proof protocol
0 references
signature graphs
0 references
0 references
