scientific article
From MaRDI portal
Publication:4035723
zbMath0825.94195MaRDI QIDQ4035723
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Limits on the usefulness of random oracles ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ On Privacy Models for RFID ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Bounds on the efficiency of black-box commitment schemes ⋮ Composition Implies Adaptive Security in Minicrypt ⋮ Clever Arbiters Versus Malicious Adversaries ⋮ Oblivious transfer is in MiniQCrypt ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: