Sciweavers

4332 search results - page 333 / 867
» A Probabilistic Identification Result
Sort
View
CRYPTO
2001
Springer
136views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Session-Key Generation Using Human Passwords Only
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...
Oded Goldreich, Yehuda Lindell
ECSQARU
2001
Springer
15 years 11 months ago
Polymorphism of Human Judgment under Uncertainty
The aim of this paper is to test if conjunctive and disjunctive judgments are differently accounted for possibility and probability theories depending on whether (1) judgments are ...
Rui Da Silva Neves, Eric Raufaste
FOCS
2000
IEEE
15 years 11 months ago
On the Hardness of Graph Isomorphism
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
Jacobo Torán
COCO
1994
Springer
89views Algorithms» more  COCO 1994»
15 years 10 months ago
Relationships Among PL, #L, and the Determinant
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
Eric Allender, Mitsunori Ogihara
FOCS
1992
IEEE
15 years 10 months ago
Proof Verification and Hardness of Approximation Problems
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...