Sciweavers

34 search results - page 5 / 7
» Strong Cryptography from Weak Secrets
Sort
View
ICNP
2000
IEEE
14 years 2 months ago
Hop Integrity in Computer Networks
A computer network is said to provide hop integrity iff when any router p in the network receives a message m supposedly from an adjacent router q, then p can check that m was ind...
Mohamed G. Gouda, E. N. Elnozahy, Chin-Tser Huang,...
JCSS
2006
102views more  JCSS 2006»
13 years 9 months ago
Password-based authentication and key distribution protocols with perfect forward secrecy
In an open networking environment, a workstation usually needs to identify its legal users for providing its services. Kerberos provides an efficient approach whereby a trusted th...
Hung-Min Sun, Her-Tyan Yeh
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
14 years 3 months ago
Obfuscation for Cryptographic Purposes
Abstract. An obfuscation O of a function F should satisfy two requirements: firstly, using O it should be possible to evaluate F; secondly, O should not reveal anything about F th...
Dennis Hofheinz, John Malone-Lee, Martijn Stam
FOCS
2000
IEEE
14 years 2 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
TCC
2009
Springer
117views Cryptology» more  TCC 2009»
14 years 10 months ago
Towards a Theory of Extractable Functions
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
Ran Canetti, Ronny Ramzi Dakdouk