Results 1  10
of
1,505
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 861 (18 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
A hardcore predicate for all oneway functions
 In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing
, 1989
"... Abstract rity of f. In fact, for inputs (to f*) of practical size, the pieces effected by f are so small A central tool in constructing pseudorandom that f can be inverted (and the “hardcore” generators, secure encryption functions, and bit computed) by exhaustive search. in other areas are “hardc ..."
Abstract

Cited by 440 (5 self)
 Add to MetaCart
(within a polynomial) 50) given only f(z). Both b, f are computable security. Namely, we prove a conjecture of in polynomial time. [Levin 87, sec. 5.6.21 that the sca1a.r product [Yao 821 transforms any oneway function of boolean vectors p, x is a hardcore of every f into a more complicated one, f
A classical oneway function to confound quantum adversaries
, 2008
"... The promise of quantum computation and its consequences for complexitytheoretic cryptography motivates an immediate search for cryptosystems which can be implemented with current technology, but which remain secure even in the presence of quantum computers. Inspired by recent negative results perta ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
pertaining to the nonabelian hidden subgroup problem, we present here a classical algebraic function fV (M) of a matrix M which we believe is a oneway function secure against quantum attacks. Specifically, inverting fV reduces naturally to solving a hidden subgroup problem over the general linear group
Universal OneWay Hash Functions and their Cryptographic Applications
, 1989
"... We define a Universal OneWay Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We ..."
Abstract

Cited by 351 (15 self)
 Add to MetaCart
We define a Universal OneWay Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We
Password Authentication with Insecure Communication
, 1981
"... A method of user password authentication is described which is secure even if an intruder can read the system's data, and can tamper with or eavesdrop on the communication between the user and the system. The method assumes a secure oneway encryption function and can be implemented with a mi ..."
Abstract

Cited by 548 (0 self)
 Add to MetaCart
A method of user password authentication is described which is secure even if an intruder can read the system's data, and can tamper with or eavesdrop on the communication between the user and the system. The method assumes a secure oneway encryption function and can be implemented with a
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
, 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract

Cited by 534 (8 self)
 Add to MetaCart
. In order to support use with nodes of limited CPU processing capability, and to guard against DenialofService attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient oneway hash functions and do not use asymmetric cryptographic
Analysis of Group Key Management Scheme using Oneway Function Tree
"... Many real time network applications like teleconferences, online gaming, videoondemand, Payperview video streaming are based on group communications. These applications can be implemented by using secure multicast in which Group communication is secured by encrypting / decrypting data stream wit ..."
Abstract
 Add to MetaCart
establishment has been developed by using oneway function tree of degree three. The ternary OFT key tree is a particular type of ternary tree in which each interior node has maximum three children. Every leaf of the tree is associated with a group member, and the node secret of the root is the common group key
Oneway functions are necessary and sufficient for secure signatures
, 1990
"... Much research in theoretical cryptography has been centered around finding the weakest possible cryptographic assumptions required to implement major primitives. Ever since Diffie and Hellman first suggested that modern ..."
Abstract

Cited by 229 (0 self)
 Add to MetaCart
Much research in theoretical cryptography has been centered around finding the weakest possible cryptographic assumptions required to implement major primitives. Ever since Diffie and Hellman first suggested that modern
Key Establishment in Large Dynamic Groups Using OneWay Function Trees
, 1998
"... We present and analyze a new algorithm for establishing shared cryptographic keys in large, dynamically changing groups. Our algorithm is based on a novel application of oneway function trees. In comparison with previously published methods, our algorithm achieves a new minimum in the number of bit ..."
Abstract

Cited by 234 (3 self)
 Add to MetaCart
We present and analyze a new algorithm for establishing shared cryptographic keys in large, dynamically changing groups. Our algorithm is based on a novel application of oneway function trees. In comparison with previously published methods, our algorithm achieves a new minimum in the number
High performance messaging on workstations: Illinois Fast Messages (FM) for Myrinet
 In Supercomputing
, 1995
"... In most computer systems, software overhead dominates the cost of messaging, reducing delivered performance, especially for short messages. Efficient software messaging layers are needed to deliver the hardware performance to the application level and to support tightlycoupled workstation clusters. ..."
Abstract

Cited by 311 (15 self)
 Add to MetaCart
. Illinois Fast Messages (FM) 1.0 is a high speed messaging layer that delivers low latency and high bandwidth for short messages. For 128byte packets, FM achieves bandwidths of 16.2 MB/s and oneway latencies 32 s on Myrinetconnected SPARCstations (userlevel to userlevel). For shorter packets, we have
Results 1  10
of
1,505