Comparison Based Semantic Security is Probabilistic Polynomial Time Equivalent to Indistinguishability.
Ali BagherzandiJavad MohajeriMahmoud SalmasizadehPublished in: Int. J. Netw. Secur. (2008)
Keyphrases
- encryption scheme
- deterministic finite state automata
- semantically equivalent
- generative model
- bayesian networks
- computational complexity
- information security
- semantic web
- access control
- semantic annotation
- worst case
- rough sets
- natural language processing
- probabilistic model
- special case
- high level
- security issues
- domain ontology
- latent semantic
- probabilistic logic
- semantic knowledge
- security requirements
- security policies
- desirable properties
- network security
- semantic network
- database
- semantic information
- domain specific
- learning algorithm