Threshold Computation and Cryptographic Security

DOI10.1137/S0097539792240467MaRDI QIDQ4337431zbMATH OpenOpenAlexWikidataFDO

Authors Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf

Publication date 17 August 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792240467

zbMATH Keywords

cryptographyprobabilistic computingthreshold computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Threshold circuits of bounded depth
• A decisive characterization of BPP
• On hiding information from an oracle
• scientific article; zbMATH DE number 176508
• scientific article; zbMATH DE number 2011858

Cited in

(17)

• SELF-SPECIFYING MACHINES
• Quantum computing, postselection, and probabilistic polynomial-time
• Lower bounds and the hardness of counting properties
• Computational complexity of the landscape. I.
• Rectangles are nonnegative juntas
• The robustness of LWPP and WPP, with an application to graph reconstruction
• The landscape of communication complexity classes
• The consequences of eliminating NP solutions
• Complexity results in graph reconstruction
• Languages polylog-time reducible to dot-depth 1/2
• Query-monotonic Turing reductions
• Error-bounded probabilistic computations between MA and AM
• Relativized worlds with an infinite hierarchy
• Commuting quantum circuits and complexity of Ising partition functions
• Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
• Computational tameness of classical non-causal models
• PP is closed under intersection

This page was built for publication: Threshold Computation and Cryptographic Security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337431)