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. Fast Public-Key Silent OT and More from Constrained Naor-Reingold
  1. Home
  2. Publications
  3. Fast Public-Key Silent OT and More from Constrained Naor-Reingold

Fast Public-Key Silent OT and More from Constrained Naor-Reingold

Authors:
  • DBDung Bui
    Dung Bui
  • GCGeoffroy Couteau
    Geoffroy Couteau
  • PMPierre Meyer
    Pierre Meyer
  • APAlain Passelègue
    Alain Passelègue
  • MRMahshid Riahinia
    Mahshid Riahinia

Publisher website
Google Scholar
  • 29 April 2024
    • book chapter
    • Published by Springer Nature
    • p. 88-118
    • DOI:10.1007/978-3-031-58751-1_4
Abstract
No abstract available
Keywords
  • OBLIVIOUS TRANSFER
  • PSEUDORANDOM FUNCTIONS
  • PUBLIC-KEY SILENT
  • PSEUDORANDOM
  • COMPUTATION PROTOCOLS
  • JOINTLY RUN
  • RUN SECURE
  • SECURE COMPUTATION
  • NAOR-REINGOLD PSEUDORANDOM
  • CONSTRAINED PSEUDORANDOM

This publication has 73 references indexed in Scilit:

  • On the Concrete Security of Goldreich’s Pseudorandom Generator
    2018
  • Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
    2006
  • Curve25519: New Diffie-Hellman Speed Records
    2006
  • Hierarchical Identity Based Encryption with Constant Size Ciphertext
    2005
  • On Pseudorandom Generators in NC0
    2001
  • Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
    2001
  • Non-Interactive Oblivious Transfer and Applications
    2001
  • On the Cryptographic Applications of Random Functions (Extended Abstract)
    2000
  • Precomputing Oblivious Transfer
    1995
  • Cryptographic Primitives Based on Hard Learning Problems
    1994

Publications with shared reference occurs when two publications share one or more common references. This publication has 8415 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 29 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.