Concurrent secure computation with optimal query complexity

DOI10.1007/978-3-662-48000-7_3MaRDI QIDQ3457059zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Vipul Goyal, Abhishek Jain

Publication date 10 December 2015

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

Full work available at URL https://doi.org/10.1007/978-3-662-48000-7_3

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On concurrently secure computation in the multiple ideal query model
• What Information Is Leaked under Concurrent Composition?
• Password-authenticated session-key generation on the internet in the plain model
• Concurrently secure computation in constant rounds
• Bounded-concurrent secure multi-party computation with a dishonest majority

Cites work

• Concurrent zero knowledge, revisited
• Concurrently secure computation in constant rounds
• Impossibility results for static input secure computation
• On concurrently secure computation in the multiple ideal query model
• Password-authenticated session-key generation on the internet in the plain model
• Precise Concurrent Zero Knowledge
• Session-key generation using human passwords only
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• What Information Is Leaked under Concurrent Composition?

Cited in

(5)

• Automata, Languages and Programming
• Efficient Concurrent Covert Computation of String Equality and Set Intersection
• Concurrently composable security with shielded super-polynomial simulators
• On concurrently secure computation in the multiple ideal query model
• A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation

This page was built for publication: Concurrent secure computation with optimal query complexity

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