Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-3
|
Results: 3
AN EFFICIENT NONINTERACTIVE ZERO-KNOWLEDGE PROOF SYSTEM FOR NP WITH GENERAL ASSUMPTIONS
Authors:
KILIAN J PETRANK E
Citation:
J. Kilian et E. Petrank, AN EFFICIENT NONINTERACTIVE ZERO-KNOWLEDGE PROOF SYSTEM FOR NP WITH GENERAL ASSUMPTIONS, Journal of cryptology, 11(1), 1998, pp. 1-27
COMPUTATIONAL-COMPLEXITY AND KNOWLEDGE COMPLEXITY
Authors:
GOLDREICH O OSTROVSKY R PETRANK E
Citation:
O. Goldreich et al., COMPUTATIONAL-COMPLEXITY AND KNOWLEDGE COMPLEXITY, SIAM journal on computing, 27(4), 1998, pp. 1116-1141
IS CODE EQUIVALENCE EASY TO DECIDE
Authors:
PETRANK E ROTH RM
Citation:
E. Petrank et Rm. Roth, IS CODE EQUIVALENCE EASY TO DECIDE, IEEE transactions on information theory, 43(5), 1997, pp. 1602-1604
Risultati:
1-3
|