Functional inversion and communication complexity

DOI10.1007/BF02318547zbMath0803.94001MaRDI QIDQ1335026

Shang-Hua Teng

Publication date: 26 September 1994

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

cryptanalysisone-way functionBoolean circuitsmultiparty communication complexityfunctional inversionsring-protocol

Mathematics Subject Classification ID

Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-way permutations in NC 0
• The VLSI Complexity of Sorting
• Security, veriflability, and universality in distributed computing
• Parallel Prefix Computation
• Applications of a Planar Separator Theorem
• Planar Formulae and Their Uses
• A method for obtaining digital signatures and public-key cryptosystems
• The complexity of theorem-proving procedures