scientific article; zbMATH DE number 2009949
From MaRDI portal
Publication:4434869
zbMATH Open1038.94523MaRDI QIDQ4434869FDOQ4434869
Authors: Ran Canetti, Eyal Kushilevitz, Yehuda Lindell 
Publication date: 26 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560068.htm
Title of this publication is not available (Why is that?)
Recommendations
- On the limitations of universally composable two-party computation without set-up assumptions
- Universally composable two-party and multi-party secure computation
- Bounded-concurrent secure two-party computation without setup assumptions
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
Cited In (30)
- Universally composable two-party and multi-party secure computation
- Computational hardness of optimal fair computation: beyond Minicrypt
- On the relationships between notions of simulation-based security
- On the structure of unconditional UC hybrid protocols
- A zero-one law for cryptographic complexity with respect to computational UC security
- A note on universal composable zero-knowledge in the common reference string model
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- Impossibility results for universal composability in public-key models and with fixed inputs
- Long-term security and universal composability
- On concurrent multi-party quantum computation
- A universally composable PAKE with zero communication cost. (And why it shouldn't be considered UC-secure)
- Concurrently composable non-interactive secure computation
- Adaptive hardness and composable security in the plain model from standard assumptions
- The reactive simulatability (RSIM) framework for asynchronous systems
- Universally composable anonymous hash certification model
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Towards accountability in CRS generation
- Lower bounds for non-black-box zero knowledge
- Lower bounds and impossibility results for concurrent self composition
- A simpler variant of universally composable security for standard multiparty computation
- Concurrently composable security with shielded super-polynomial simulators
- Isolated Proofs of Knowledge and Isolated Zero Knowledge
- Initiator-resilient universally composable key exchange
- Universally composable incoercibility
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- On the limitations of universally composable two-party computation without set-up assumptions
- Local Sequentiality Does Not Help for Concurrent Composition
- Universally-Composable Two-Party Computation in Two Rounds
- Secure computation without authentication
- On the exact round complexity of self-composable two-party computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434869)
