Sciweavers

2 search results - page 1 / 1
» SZK Proofs for Black-Box Group Problems
Sort
View
71
Voted
CSR
2006
Springer
15 years 1 months ago
SZK Proofs for Black-Box Group Problems
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
Vikraman Arvind, Bireswar Das
ASIACRYPT
2008
Springer
14 years 11 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...