A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation

DOI10.1007/978-3-319-12160-4_2zbMath1445.68075MaRDI QIDQ3193251

Tomas Toft

Publication date: 16 October 2015

Published in: Information Security and Cryptology -- ICISC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12160-4_2

zbMATH Keywords

data structures; MPC; reactive functionalities

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

94A60: Cryptography

68P05: Data structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Oblivious RAMs without cryptogrpahic assumptions
• Multiparty Computation from Somewhat Homomorphic Encryption
• Perfectly Secure Oblivious RAM without Random Oracles
• How to share a secret
• Sub-linear, Secure Comparison with Two Non-colluding Parties
• Oblivious RAM Revisited
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Software protection and simulation on oblivious RAMs
• Distributed Oblivious RAM for Secure Two-Party Computation
• Anti-persistence
• Algorithm Theory - SWAT 2004
• Secure Equality and Greater-Than Tests with Sublinear Online Complexity
• Advances in Cryptology - CRYPTO 2003
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol