ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2502.13830
  4. Cited By
The Round Complexity of Black-Box Post-Quantum Secure Computation

The Round Complexity of Black-Box Post-Quantum Secure Computation

20 February 2025
Rohit Chatterjee
Xiao Liang
Omkant Pandey
Takashi Yamakawa
    LRM
ArXivPDFHTML

Papers citing "The Round Complexity of Black-Box Post-Quantum Secure Computation"

1 / 1 papers shown
Title
Quantum-Computable One-Way Functions without One-Way Functions
Quantum-Computable One-Way Functions without One-Way Functions
William Kretschmer
Luowen Qian
Avishay Tal
31
2
0
04 Nov 2024
1