Scilit logo
  • Rankings
  • Search Publications
    Cited-by Search
  • Sources
  • Publishers
  • Scholars
    Top Cited Scholars
  • Organizations
  • Scilit
    About Us
    Advisory Board
    Data Sources
    Career
    Support / Contact
    User Guide
    Publisher User
    Search Function
    Rankings Function
    API Resource
    Scilit Knowledge
    Metrics
    Scilit Recognitions
    Publications Classification
    Media
    News
    Blog
Register
  1. Home
  2. Publications
  3. Faster Pseudorandom Correlation Generators via Walsh-Hadamard Transform
  1. Home
  2. Publications
  3. Faster Pseudorandom Correlation Generators via Walsh-Hadamard Transform

Faster Pseudorandom Correlation Generators via Walsh-Hadamard Transform

Authors:
  • ZLZhe Li
    Zhe Li
  • HLHongqing Liu
    Hongqing Liu
  • CXChaoping Xing
    Chaoping Xing
  • YYYizhou Yao
    Yizhou Yao
  • CYChen Yuan
    Chen Yuan

Publisher website
Google Scholar
  • 12 August 2026
    • book chapter
    • Published by Springer Nature
    • p. 430-461
    • DOI:10.1007/978-3-032-35418-1_14
Abstract
No abstract available
Keywords
  • PSEUDORANDOM CORRELATION
  • CORRELATION GENERATORS
  • PRIME FIELD
  • PRIME
  • CORRELATION
  • PSEUDORANDOM
  • GENERATORS
  • LARGE PRIME
  • FASTER PSEUDORANDOM
  • SUBLINEAR COMMUNICATION

This publication has 62 references indexed in Scilit:

  • Correlated Pseudorandomness from Expand-Accumulate Codes
    2022
  • Le Mans: Dynamic and Fluid MPC for Dishonest Majority
    2022
  • More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings
    2022
  • Statistical Decoding 2.0: Reducing Decoding to LPN
    2022
  • Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes
    2021
  • Efficient Pseudorandom Correlation Generators from Ring-LPN
    2020
  • Efficient Pseudorandom Correlation Generators: Silent OT Extension and More
    2019
  • Statistical Decoding Revisited
    2006
  • A Statistical Decoding Algorithm for General Linear Block Codes
    2001
  • Efficient Multiparty Protocols Using Circuit Randomization
    2001

Publications with shared reference occurs when two publications share one or more common references. This publication has 13850 Publications with shared reference indexed in Scilit, top 10 records with the most shared references are listed below:

View publications in search results
Cited by 2 articles
Scilit logo

Have questions? Email us at support@scilit.com

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.

MDPI initiatives

  • MDPI Journals
  • MDPI Books
  • Sciforum
  • Proceedings Series
  • Preprints.org
  • SciProfiles
  • Encyclopedia
  • JAMS

Legal

  • Privacy
  • Terms
  • About
  • Contact
  • Disclaimer

Follow us

  • facebook icon
  • x icon
  • linkedin icon

Join us

  • Career

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.