Improved black-box constructions of composable secure computation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 1304087 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 2009949 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- A new approach to black-box concurrent secure computation
- A note on constant-round zero-knowledge proofs of knowledge
- A unified approach to constructing black-box UC protocols in trusted setup models
- A unified framework for UC from only OT
- A unified framework for concurrent security
- Actively secure garbled circuits with constant communication overhead in the plain model
- Adaptive hardness and composable security in the plain model from standard assumptions
- Adaptive hardness and composable security in the plain model from standard assumptions
- Advances in Cryptology – CRYPTO 2004
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Black-box constructions for secure computation
- Black-box constructions of composable protocols without set-up
- Black-box non-black-box zero knowledge
- Black-box, round-efficient secure computation via non-malleability amplification
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Bounded-concurrent secure two-party computation without setup assumptions
- Bringing people of different beliefs together to do UC
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Concurrent Non-malleable Commitments from Any One-Way Function
- Concurrent general composition of secure protocols in the timing model
- Concurrent non-malleable zero knowledge proofs
- Concurrent non-malleable zero knowledge with adaptive inputs
- Concurrently composable security with shielded super-polynomial simulators
- Concurrently secure computation in constant rounds
- Constant round non-malleable protocols using one way functions
- Constant-round black-box construction of composable multi-party computation protocol
- Constructing non-malleable commitments: a black-box approach
- Cryptography in the Multi-string Model
- Efficiency preserving transformations for concurrent non-malleable zero knowledge
- Founding Cryptography on Oblivious Transfer – Efficiently
- Founding Cryptography on Tamper-Proof Hardware Tokens
- New notions of security: achieving universal composability without trusted setup
- Non-malleability amplification
- Non-malleable zero knowledge: black-box constructions and definitional relationships
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- On concurrently secure computation in the multiple ideal query model
- Password-authenticated session-key generation on the internet in the plain model
- Resettable zero-knowledge (extended abstract)
- Round optimal black-box ``commit-and-prove
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Round-efficient black-box construction of composable multi-party computation
- Round-optimal black-box two-party computation
- Security and composition of multiparty cryptographic protocols
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Textbook non-malleable commitments
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Universally composable secure computation with corrupted tokens
- Universally composable two-party and multi-party secure computation
- What Information Is Leaked under Concurrent Composition?
Cited in
(4)
This page was built for publication: Improved black-box constructions of composable secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842549)
