New notions of security
From MaRDI portal
Publication:3580997
DOI10.1145/1007352.1007394zbMath1192.94124MaRDI QIDQ3580997
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
68P25: Data encryption (aspects in computer science)
68M12: Network protocols
94A62: Authentication, digital signatures and secret sharing
Related Items
Efficient non-malleable commitment schemes, 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, Efficient non-malleable commitment schemes, Conditional Reactive Simulatability, Concurrently composable non-interactive secure computation, A new approach to efficient non-malleable zero-knowledge, Impossibility results for universal composability in public-key models and with fixed inputs, General composition and universal composability in secure multiparty computation, One-message zero knowledge and non-malleable commitments, Unbounded ABE via bilinear entropy expansion, revisited, Round-efficient black-box construction of composable multi-party computation, Computing boundary cycle of a pseudo-triangle polygon from its visibility graph, What security can we achieve within 4 rounds?, Overcoming impossibility results in composable security using interval-wise guarantees, Succinct non-interactive secure computation, A unified and composable take on ratcheting, Efficient hybrid encryption from ID-based encryption, The reactive simulatability (RSIM) framework for asynchronous systems, 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, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, What Security Can We Achieve Within 4 Rounds?, Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity, Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions, Local Sequentiality Does Not Help for Concurrent Composition
