New hash functions and their use in authentication and set equality

Wegman, Mark N.; Carter, J.Lawrence

doi:10.1016/0022-0000(81)90033-7

Cited by 1,056 publications

(721 citation statements)

References 7 publications

Supporting

Mentioning

697

Contrasting

Unclassified

Order By: Relevance

“…As pointed out by Naor and Yung [NY89], we can get composite schemes with logarithmic key size by using a tree hash, which is the same as a construction proposed by Wegman and Carter [WC81] for composing universal hash functions. For simplicity, assume that a = bd for an integer d, and that we want to hash messages of length bd t for some t > 0.…”

Section: Previous Composition Constructionsmentioning

confidence: 94%

A Composition Theorem for Universal One-Way Hash Functions

Shoup

2000

Advances in Cryptology — EUROCRYPT 2000

View full text Add to dashboard Cite

show abstract

Section: Previous Composition Constructionsmentioning

confidence: 94%

A Composition Theorem for Universal One-Way Hash Functions

Shoup

2000

Advances in Cryptology — EUROCRYPT 2000

View full text Add to dashboard Cite

show abstract

“…In addition to secrecy, we also need to ensure authenticity of the communication between the components. We observe that this can be done easily using information-theoretic MAC schemes based on universalhashing [33,3]. Roughly, each pair of components will maintain rolling MAC keys that are only used Θ(1) times.…”

Section: From Ocl + To Ldsmentioning

confidence: 99%

“…We therefore show how to realize secure communication channels over insecure networks in a leakage-resilient manner. This construction, which uses noncommitting encryption [12] and information theoretic MACs (e.g., [33,3]), is the main technical novelty in the current work. See Section 1.4.…”

Section: Introductionmentioning

confidence: 99%

Program Obfuscation with Leaky Hardware

Bitansky

Canetti

Goldwasser

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We consider general program obfuscation mechanisms using "somewhat trusted" hardware devices, with the goal of minimizing the usage of the hardware, its complexity, and the required trust. Specifically, our solution has the following properties:(i) The obfuscation remains secure even if all the hardware devices in use are leaky. That is, the adversary can obtain the result of evaluating any function on the local state of the device, as long as this function has short output. In addition the adversary also controls the communication between the devices.(ii) The number of hardware devices used in an obfuscation and the amount of work they perform are polynomial in the security parameter independently of the obfuscated function's complexity.(iii) A (universal) set of hardware components, owned by the user, is initialized only once and from that point on can be used with multiple "software-based" obfuscations sent by different vendors.

show abstract

“…For each set of parameters, 1000 trials were run, with a new graph and new random choice of (non-compromised and non-adjacent) Alice and Bob for each trial. The number of paths was chosen according to equation (6) and the number of edges according to equation (3), with δ = 0.01 used as the target probability of compromise. The variation of these parameters with changes in t and N is shown in figure 3.…”

Section: Simulation Resultsmentioning

confidence: 99%

Distributed authentication for randomly compromised networks

2009

View full text Add to dashboard Cite

Abstract. We introduce a simple, practical approach with probabilistic information-theoretic security to solve one of quantum key distribution's major security weaknesses: the requirement of an authenticated classical channel to prevent man-in-the-middle attacks. Our scheme employs classical secret sharing and partially trusted intermediaries to provide arbitrarily high confidence in the security of the protocol. Although certain failures elude detection, we discuss preemptive strategies to reduce the probability of failure to an arbitrarily small level: the probability of such failures is exponentially suppressed with increases in connectivity (i.e. connections per node).

show abstract

New hash functions and their use in authentication and set equality

Cited by 1,056 publications

References 7 publications

A Composition Theorem for Universal One-Way Hash Functions

A Composition Theorem for Universal One-Way Hash Functions

Program Obfuscation with Leaky Hardware

Distributed authentication for randomly compromised networks

Contact Info

Product

Resources

About