Computational hardness of optimal fair computation: beyond Minicrypt

DOI10.1007/978-3-030-84245-1_2zbMath1486.94128OpenAlexW3184795314MaRDI QIDQ2128555

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_2

black-box separation cryptomania fair computation hardness of computation results optimal fair coin-tossing secure function evaluation functionalities

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Bit commitment using pseudorandomness
Perfect zero-knowledge arguments for NP using any one-way permutation
On the structure of unconditional UC hybrid protocols
Towards characterizing securely computable two-party randomized functions
Security and composition of multiparty cryptographic protocols
Black-box use of one-way functions is useless for optimal fair coin-tossing
On Fair Exchange, Fair Coins and Fair Sampling
Notions of Black-Box Reductions, Revisited
On the Classification of Finite Boolean Functions up to Fairness
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
Measures, Integrals and Martingales
A Zero-One Law for Secure Multi-party Computation with Ternary Outputs
On the Black-Box Complexity of Optimally-Fair Coin Tossing
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
More general completeness theorems for secure two-party computation
Partial Fairness in Secure Two-Party Computation
Lower bounds on the efficiency of encryption and digital signature schemes
Protocols for Multiparty Coin Toss with Dishonest Majority
A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
An Optimally Fair Coin Toss
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Coin flipping by telephone a protocol for solving impossible problems
A Pseudorandom Generator from any One-way Function
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
Fair Coin Flipping: Tighter Analysis and the Many-Party Case
Communication Complexity
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
Completeness for Symmetric Two-Party Functionalities - Revisited
How to Simulate It – A Tutorial on the Simulation Proof Technique
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
Coin Flipping with Constant Bias Implies One-Way Functions
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
On the Power of Public-Key Encryption in Secure Computation
Towards Characterizing Complete Fairness in Secure Two-Party Computation
Theory of Cryptography
Theory of Cryptography
On the complexity of fair coin flipping

This page was built for publication: Computational hardness of optimal fair computation: beyond Minicrypt