Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
From MaRDI portal
Recommendations
- On adaptively secure protocols
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Adaptive security of multi-party protocols, revisited
- Adaptive and composable non-committing encryptions
- Concurrent composition of secure protocols in the timing model
- Adaptive versus non-adaptive security of multi-party protocols
- scientific article; zbMATH DE number 1722683
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- Secure composition of cryptographic protocols. (Abstract)
Cites work
- A unified framework for concurrent security
- A zero-one law for cryptographic complexity with respect to computational UC security
- Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
- Adaptive hardness and composable security in the plain model from standard assumptions
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Bit commitment using pseudorandomness
- Black-box constructions of composable protocols without set-up
- Concurrent composition of secure protocols in the timing model
- Concurrent Non-malleable Commitments from Any One-Way Function
- Constant-round black-box construction of composable multi-party computation protocol
- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
- Founding Cryptography on Oblivious Transfer – Efficiently
- 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 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1759794 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- New notions of security: achieving universal composability without trusted setup
- Nonmalleable Cryptography
- On adaptively secure protocols
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- On the limitations of universally composable two-party computation without set-up assumptions
- Revisiting lower and upper bounds for selective decommitments
- Round-efficient black-box construction of composable multi-party computation
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Theory of Cryptography
- Universally Composable Security with Global Setup
Cited in
(8)- Adaptive hardness and composable security in the plain model from standard assumptions
- On the Power of Secure Two-Party Computation
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Advances in Cryptology - EUROCRYPT 2004
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Concurrently composable security with shielded super-polynomial simulators
- Adaptively secure MPC with sublinear communication complexity
- Improved black-box constructions of composable secure computation
This page was built for publication: Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179365)
