On adaptively secure protocols

DOI10.1007/978-3-319-10879-7_26MaRDI QIDQ2922675zbMATH OpenOpenAlexFDO

Authors Muthuramakrishnan Venkitasubramaniam

Publication date 14 October 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10879-7_26

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

• Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
• Adaptive security of multi-party protocols, revisited
• Adaptively secure, universally composable, multiparty computation in constant rounds
• Constant-round adaptive zero-knowledge proofs for NP
• Concurrent non-malleable zero knowledge with adaptive inputs

Cited in

(23)

• Unbounded ABE via bilinear entropy expansion, revisited
• On the secure implementation of security protocols
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• scientific article; zbMATH DE number 1722683 (Why is no real title available?)
• Virtual smart cards: how to sign with a password and a server
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
• Adaptive Security of Constrained PRFs
• Adaptive versus Static Security in the UC Model
• Concurrent non-malleable zero knowledge with adaptive inputs
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• scientific article; zbMATH DE number 1504548 (Why is no real title available?)
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
• Contracts for security adaptation
• Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
• 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
• Let attackers program ideal models: modularity and composability for adaptive compromise
• Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW
• Four-round statistical non-malleable zero-knowledge

This page was built for publication: On adaptively secure protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922675)