On the round complexity of secure quantum computation (Q2120084): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Post-quantum multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to round-optimal secure multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure software leasing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Promise zero knowledge and its applications to round optimal MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum FHE (almost) as secure as classical / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four round secure computation without setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal quantum computation with ideal Clifford gates and noisy ancillas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reusable non-interactive secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round optimal secure multiparty computation from minimal assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multi-party quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multi-party quantum computation with a dishonest majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Actively Secure Two-Party Evaluation of Any Quantum Operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Round Complexity of Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-round multiparty secure computation from minimal assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Instantaneous Nonlocal Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Non-interactive Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-optimal secure two-party computation from trapdoor permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why quantum bit commitment and ideal quantum coin tossing are impossible. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5278350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instantaneous measurements of nonlocal variables / rank
 
Normal rank

Latest revision as of 12:08, 28 July 2024

scientific article
Language Label Description Also known as
English
On the round complexity of secure quantum computation
scientific article

    Statements

    On the round complexity of secure quantum computation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 March 2022
    0 references
    0 references
    0 references

    Identifiers