Massachusetts Institute of Technology / Weizmann Institute / /
IndustryTerm
polynomial time error decoding algorithm / secret communications / internet involving several parties / theoretic secure multi-party protocols / polynomial time integer factorization algorithm / polynomial time algorithms / probabilistic polynomial time algorithm / probabilistic algorithm / polynomial time nondeterministic algorithm / polynomial time algorithm / feasible algorithms / multi-party secure protocols / probabilistic polynomial time algorithms / real world applications / party protocols / polynomial size algorithm / encryption systems / polynomial time integer factorization algorithms / adversary algorithms / adversary algorithm / /
Organization
Department of Computer Science and Applied Mathematics / Weizmann Institute / V PPT / Massachusetts Institute of Technology / Department of Electrical Engineering and Computer Science / /
ProvinceOrState
Massachusetts / /
Technology
encryption / sampling algorithm / multi-party secure protocols / perfectly secure encryption / Cryptography / polynomial time error decoding algorithm / 3 PPT algorithm / theoretic secure multi-party protocols / PPT adversary algorithm / polynomial time algorithm / public-key encryption / probabilistic polynomial time algorithms / two party protocols / adversary algorithms / polynomial time integer factorization algorithms / polynomial time nondeterministic algorithm / polynomial time algorithms / simulation / PPT algorithms / digital signature / probabilistic polynomial time algorithm / probabilistic algorithm / polynomial size algorithm / polynomial time integer factorization algorithm / /
ICM 2002 • Vol. I • 245^272 Mathematical Foundations of