Incremental cryptography and security of public hash functions

Odule, Tola John

doi:10.4314/jonamp.v11i1.40244

Search citation statements

Order By: Relevance

Paper Sections

Select...

Assessment Of the 'Exact Security' Of Our Scheme1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

2017

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This demands not only that we avoid asymptotic and address security exactly, but also that we strive for security reductions which are as efficient as possible. 2 Thus the theorem proving the security of our basic scheme, as in [12], quantifies the resources and success probability of a potential adversary let her run for time …”

Section: Assessment Of the 'Exact Security' Of Our Schemementioning

confidence: 99%

A Modular-Arithmetic-Based Encryption Scheme

Odule¹,

Awodele²

2015

IJSIA

View full text Add to dashboard Cite

show abstract

Section: Assessment Of the 'Exact Security' Of Our Schemementioning

confidence: 99%

A Modular-Arithmetic-Based Encryption Scheme

Odule¹,

Awodele²

2015

IJSIA

View full text Add to dashboard Cite

show abstract

“…The philosophy behind a universal one-way hash function (UOWHF) is that if, first the input is selected and subsequently the hash function, it does not help an opponent to find collisions for the hash function [1]. Collisions are only useful if first the function is fixed and subsequently one can search for two colliding inputs.…”

Section: Introductionmentioning

confidence: 99%

A Method for the Construction of a Cryptographic Group-theoretic Language

Odule¹,

kaka²

2017

AIMS Research Journal

View full text Add to dashboard Cite

This paper generalizes the theory of universal hashing in the construction of cryptographic protocols using group- theoretic language formalisms. This idea is due to Wegman and Carter who gave a construction in 1981 which is extremely useful when the number of authenticators is small compared to the number of possible source states (plaintext messages) in order to accommodate the situation where we would like to authenticate a sequence of messages with the same key. Unlike previous methods for doing this we do not require that each message in the sequence have a “counter” attached to it. We provide necessary definitions and theory and then give a construction which achieves our goals. Keywords: Universal hashing, projective hash family, cryptographic protocol, group-theoretic language,

show abstract

Incremental cryptography and security of public hash functions

Cited by 2 publications

References 0 publications

A Modular-Arithmetic-Based Encryption Scheme

A Modular-Arithmetic-Based Encryption Scheme

A Method for the Construction of a Cryptographic Group-theoretic Language

Contact Info

Product

Resources

About