2011
DOI: 10.1007/978-3-642-20398-5_20
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. When discussing protocol properties in the symbolic (DolevYao; term-based) model of cryptography, the set of cryptographic primitives is defined by the constructors of the term algebra and by the equational theory on top of it. The set of considered primitives is not easily modifiable during the discussion. In particular, it is unclear what it means to define a new primitive from the existing ones, or why a primitive in the considered set may be unnecessary because it can be modeled using other primi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 23 publications
(26 reference statements)
0
1
0
Order By: Relevance
“…Nevertheless, we claim that we are still handling most of "symmetric cryptography" because other primitives under this label can be constructed from hashes and XORs. For example, (randomized) symmetric encryption (which also provides integrity in the symbolic model) can be defined as {m} r K = (r, h(K, h(r, K, m))⊕ m, h(r, K, m)) [15]. A pseudorandom function can be defined as PRF K (m) = h(K, m).…”
Section: Modeling Symmetric Cryptographymentioning
confidence: 99%
“…Nevertheless, we claim that we are still handling most of "symmetric cryptography" because other primitives under this label can be constructed from hashes and XORs. For example, (randomized) symmetric encryption (which also provides integrity in the symbolic model) can be defined as {m} r K = (r, h(K, h(r, K, m))⊕ m, h(r, K, m)) [15]. A pseudorandom function can be defined as PRF K (m) = h(K, m).…”
Section: Modeling Symmetric Cryptographymentioning
confidence: 99%