𝔖 Bobbio Scriptorium
✦   LIBER   ✦

One-way functions and circuit complexity

✍ Scribed by R.B. Boppana; J.C. Lagarias


Book ID
113383825
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
897 KB
Volume
74
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Circuit complexity of slice functions an
✍ Shoichi Hirose; Shuzo Yajima πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 644 KB

## Abstract This paper discusses the complexity from the viewpoint of the number of circuit elements for the slice functions and the homogeneous function, which belong to the class of monotonic logic functions. The slice function is one of those functions in which the circuit complexity is almost e

An observation on associative one-way fu
✍ Muhammad Rabi; Alan T. Sherman πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 606 KB

We introduce the notion of associative one-way functions and prove that they exist if and only if P # NP. As evidence of their utility, we present two novel protocols that apply strong forms of these functions to achieve secret-key agreement and digital signatures. @ 1997 Published by Elsevier Scien

Creating Strong, Total, Commutative, Ass
✍ Lane A Hemaspaandra; JΓΆrg Rothe πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 129 KB

Rabi and Sherman presented novel digital signature and unauthenticated secret-key agreement protocols, developed by themselves and by Rivest and Sherman. These protocols use strong, total, commutative (in the case of multiparty secret-key agreement), associative one-way functions as their key buildi

Separability and one-way functions
✍ Lance Fortnow; John D. Rogers πŸ“‚ Article πŸ“… 2002 πŸ› Springer 🌐 English βš– 233 KB