New notions of security

DOI10.1145/1007352.1007394zbMath1192.94124OpenAlexW2085140050MaRDI QIDQ3580997

Manoj Prabhakaran, Amit Sahai

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007394

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (29)

One-message zero knowledge and non-malleable commitments ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ A unified and composable take on ratcheting ⋮ Concurrently composable non-interactive secure computation ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ On concurrent multi-party quantum computation ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Adaptive security of multi-party protocols, revisited ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Efficient non-malleable commitment schemes ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ What security can we achieve within 4 rounds? ⋮ Efficient non-malleable commitment schemes ⋮ Efficient hybrid encryption from ID-based encryption ⋮ Local Sequentiality Does Not Help for Concurrent Composition ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ General composition and universal composability in secure multiparty computation ⋮ Overcoming impossibility results in composable security using interval-wise guarantees ⋮ Conditional Reactive Simulatability ⋮ Succinct non-interactive secure computation

This page was built for publication: New notions of security