Cryptography from Planted Graphs: Security with Logarithmic-Size Messages.
Damiano AbramAmos BeimelYuval IshaiEyal KushilevitzVarun NarayananPublished in: IACR Cryptol. ePrint Arch. (2023)
Keyphrases
- information security
- encryption algorithms
- security issues
- cellular automata
- maximal cliques
- intrusion detection
- worst case
- uniform random
- maximum clique
- security level
- security requirements
- graph theoretic
- graph databases
- graph matching
- memory requirements
- cyber security
- security systems
- graph theory
- network security
- access control