Number-theoretic constructions of efficient pseudo-random functions

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Proceedings 38th Annual Symposium on Foundations of Computer Science

• Publication date

  1997-10-19

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/SFCS.1997.646134
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Distributed Pseudo-random Functions and KDCs

  1999cited by this paper
• On Certain Exponential Sums and the Distribution of Diffie–Hellman Triples

  1999cited by this paper
• Optimal-depth threshold circuits for multiplication and related problems

  1999cited by this paper
• The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms

  1999cited by this paper
• Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring

  1999cited by this paper
• A Pseudorandom Generator from any One-way Function

  1999influential reference
• Oblivious Transfer with Adaptive Queries

  1999cited by this paper
• Secure and Efficient Metering

  1998cited by this paper
• A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

  1998cited by this paper
• The Decision Diffie-Hellman Problem

  1998cited by this paper
• Modern Cryptography, Probabilistic Proofs and Pseudorandomness

  1998cited by this paper
• An Implementation of Efficient Pseudo-Random Functions

  1998cited by this paper
• Lower Bounds for Discrete Logarithms and Related Problems

  1997cited by this paper
• Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information

  1997cited by this paper
• On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)

  1997cited by this paper
• Di e-hellman key distribution extended to groups

  1996cited by this paper
• Publicly Verifiable Secret Sharing

  1996cited by this paper
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes

  1996cited by this paper
• Diffie-Hellman key distribution extended to group communication

  1996cited by this paper
• Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract)

  1996cited by this paper
• Pseudorandomness and cryptographic applications

  1996cited by this paper
• Software protection and simulation on oblivious RAMs

  1996cited by this paper
• Foundations of Cryptography (Fragments of a Book)

  1995cited by this paper
• Synthesizers and their application to the parallel construction of pseudo-random functions

  1995cited by this paper
• How to share a function securely

  1994cited by this paper
• Cryptographic limitations on learning Boolean formulae and finite automata

  1994cited by this paper
• On Optimal Depth Threshold Circuits for Multiplication and Related Problems

  1994cited by this paper
• Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms

  1994cited by this paper
• Cryptographic hardness of distribution-specific learning

  1993cited by this paper
• An Efficient Off-line Electronic Cash System Based On The Representation Problem.

  1993cited by this paper
• Discrete Logarithms and Smooth Polynomials

  1993cited by this paper
• Cryptographic Primitives Based on Hard Learning Problems

  1993cited by this paper
• Depth efficient neural networks for division and related problems

  1993cited by this paper
• Fast Exponentiation with Precomputation (Extended Abstract)

  1992cited by this paper
• When won't membership queries help?

  1991cited by this paper
• Checking the correctness of memories

  1991cited by this paper
• Efficient cryptographic schemes provably as secure as subset sum

  1989cited by this paper
• New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs

  1989cited by this paper
• How to recycle random bits

  1989influential reference
• Non-Interactive Oblivious Transfer and Applications

  1989cited by this paper
• Constant depth circuits, Fourier transform, and learnability

  1989cited by this paper
• Construction of a pseudo-random generator from any one-way function

  1989cited by this paper
• An Efficient Software Protection Scheme

  1989cited by this paper
• Undeniable Signatures

  1989cited by this paper
• A hard-core predicate for all one-way functions

  1989influential reference
• Modern Cryptology

  1988cited by this paper
• On Threshold Circuits and Polynomial Computation

  1987cited by this paper
• Towards a Theory of Software Protection

  1986cited by this paper
• How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract)

  1986cited by this paper
• How to construct random functions

  1986influential reference
• Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme

  1986cited by this paper
• A Simple Unpredictable Pseudo-Random Number Generator

  1986cited by this paper
• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information

  1985cited by this paper
• Log Depth Circuits for Division and Related Problems

  1984cited by this paper
• Probabilistic Encryption

  1984cited by this paper
• On the Cryptographic Applications of Random Functions

  1984cited by this paper
• A theory of the learnable

  1984cited by this paper
• A public key cryptosystem and a signature scheme based on discrete logarithms

  1984cited by this paper
• Theory and application of trapdoor functions

  1982cited by this paper
• How to generate cryptographically strong sequences of pseudo random bits

  1982cited by this paper
• Theory and Applications of Trapdoor Functions (Extended Abstract)

  1982cited by this paper
• New Directions in Cryptography

  1976cited by this paper

• Similarity-Aware Defense Scheme for Online Brute-Force Attacks in Encrypted Deduplication

  2026cites this paper
• Non-Transferable Anonymous Tokens With Decentralized Issuance by Blind Multisignatures

  2026cites this paper
• How to Steal Oblivious Transfer from Minicrypt

  2026cites this paper
• Positive Distribution Shift as a Framework for Understanding Tractable Learning

  2026cites this paper
• Towards subversion-resistant password-protected encryption for deduplicated cloud storage

  2025cites this paper
• Fast post-quantum private set intersection from oblivious pseudorandom function for mobile social networks

  2025cites this paper
• A Survey of Post-Quantum Oblivious Protocols

  2025cites this paper
• How to Use Your Brain for Cryptography Without Trustworthy Machines

  2025cites this paper
• 1-Adaptive Weak Pseudorandom Functions

  2025influential citation
• Strong Pseudorandom Functions in AC0[2] in the Bounded-Query Setting

  2025cites this paper
• Pseudorandom Correlation Functions from Ring-LWR

  2025cites this paper
• Scalable Encrypted Deduplication Based on Location-Hiding Secret Sharing of Data Keys

  2025cites this paper
• Revisiting SGX-Based Encrypted Deduplication via PoW-Before-Encryption and Eliminating Redundant Computations

  2025cites this paper
• Quantum circuit lower bounds in the magic hierarchy

  2025cites this paper
• Privacy-Preserving Runtime Verification

  2025cites this paper
• MARS: Low-Leakage Multi Adversarial Owner and Reader Replication-free Searchable Encryption from Private Information Retrieval

  2025cites this paper
• Efficient Privacy-Preserving Blueprints for Threshold Comparison

  2025cites this paper
• Finding Balance in Unbalanced PSI: A New Construction from Single-Server PIR

  2025cites this paper
• OneTwoPAKE: Two-Round Strong Asymmetric PAKE with Ideal Security

  2025cites this paper
• Minicrypt PRFs Do Not Admit Black-Box Oblivious Evaluations

  2025cites this paper
• Gold OPRF: Post-Quantum Oblivious Power-Residue PRF

  2025cites this paper
• When Simple Permutations Mix Poorly: Limited Independence Does Not Imply Pseudorandomness

  2025cites this paper
• SoK: On Shallow Weak PRFs A Common Symmetric Building Block for MPC Protocols

  2025cites this paper
• Multilevel Matching Geometric Range Query Over Encrypted Spatial Data with Forward and Backward Privacy

  2025cites this paper
• Adaptively Secure Threshold ElGamal Decryption from DDH

  2025influential citation
• Blocklisted Oblivious Pseudorandom Functions

  2025cites this paper
• Invariant-Based Cryptography: Toward a General Framework

  2025cites this paper
• Stronger Security for Threshold Blind Signatures

  2025cites this paper
• PrivacyGo: Privacy-Preserving Ad Measurement with Multidimensional Intersection

  2025cites this paper
• A Theory of Learning with Autoregressive Chain of Thought

  2025cites this paper
• PopeDup: Popularity-Based Encrypted Deduplication With Privacy Learning Attacks Resistance and Protected Thresholds

  2025cites this paper
• Fuzzy Private Hash Matching for Harmful Media Moderation in End-to-End Encrypted Communication

  2025cites this paper
• Fully-Adaptive Two-Round Threshold Schnorr Signatures from DDH

  2025cites this paper
• Adaptively Secure Three-Round Threshold Schnorr Signatures from DDH

  2025cites this paper
• The Probably Approximately Correct Learning Model in Computational Learning Theory

  2025cites this paper
• Zeroed Out: Cryptanalysis of Weak PRFs in Alternating Moduli

  2025cites this paper
• Understanding the Identity-Transformation Approach in OIDC-Compatible Privacy-Preserving SSO Services

  2025cites this paper
• Private Set Intersection and other Set Operations in the Third Party Setting

  2025cites this paper
• A Direct PRF Construction from Kolmogorov Complexity

  2024cites this paper
• Fuzzy Private Set Intersection with Large Hyperballs

  2024influential citation
• Anonymous Complaint Aggregation for Secure Messaging

  2024cites this paper
• Constrained Pseudorandom Functions for Inner-Product Predicates from Weaker Assumptions

  2024cites this paper
• Properties of Lattice Isomorphism as a Cryptographic Group Action

  2024cites this paper
• Pseudochaotic many-body dynamics as a pseudorandom state generator

  2024cites this paper
• Amortizing Circuit-PSI in the Multiple Sender/Receiver Setting

  2024cites this paper
• End-to-Same-End Encryption: Modularly Augmenting an App with an Efficient, Portable, and Blind Cloud Storage

  2024cites this paper
• Glacius: Threshold Schnorr Signatures from DDH with Full Adaptive Security

  2024cites this paper
• Towards tightly secure short linearly homomorphic signatures

  2024cites this paper
• Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption

  2024cites this paper
• Oblivious Pseudo Random Function base on Ideal Lattice, Application in PSI and PIR

  2024cites this paper
• Key derivable signature and its application in blockchain stealth address

  2024cites this paper
• QuietOT: Lightweight Oblivious Transfer with a Public-Key Setup

  2024cites this paper
• Encrypted Data Reduction: Removing Redundancy from Encrypted Data in Outsourced Storage

  2024cites this paper
• Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions

  2024cites this paper
• Privacy-Preserving Popularity-Based Deduplication against Malicious Behaviors of the Cloud

  2024cites this paper
• Tightly Secure ID-based Authenticated Key Exchange

  2024cites this paper
• Quantum Group Actions

  2024influential citation
• Robustly reusable fuzzy extractor from isogeny

  2024cites this paper
• Optimal Traitor Tracing from Pairings

  2024influential citation
• OPRFs from Isogenies: Designs and Analysis

  2024cites this paper
• Non-Transferable Anonymous Tokens by Secret Binding

  2024cites this paper
• Sec-Reduce: Secure Reduction of Redundant and Similar Data for Cloud Storage based on Zero-Knowledge Proof

  2024cites this paper
• Secure Data Deduplication With Dynamic Access Control for Mobile Cloud Storage

  2024cites this paper
• MFKDF: Multiple Factors Knocked Down Flat

  2024cites this paper
• Threshold OPRF from Threshold Additive HE

  2024cites this paper
• Large-Scale Private Set Intersection in the Client-Server Setting

  2024cites this paper
• Tokenised Multi-client Provisioning for Dynamic Searchable Encryption with Forward and Backward Privacy

  2024cites this paper
• LaKey: Efficient Lattice-Based Distributed PRFs Enable Scalable Distributed Key Management

  2024cites this paper
• Improved Alternating Moduli PRFs and Post-Quantum Signatures

  2024cites this paper
• Efficient Maliciously Secure Oblivious Exponentiations

  2024cites this paper
• Secure Account Recovery for a Privacy-Preserving Web Service

  2024cites this paper
• Time-Restricted, Verifiable, and Efficient Query Processing Over Encrypted Data on Cloud

  2024cites this paper
• Quantum-Secure Hybrid Blockchain System for DID-based Verifiable Random Function with NTRU Linkable Ring Signature

  2023cites this paper
• Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE

  2023cites this paper
• Private and Secure Post-Quantum Verifiable Random Function with NIZK Proof and Ring-LWE Encryption in Blockchain

  2023cites this paper
• A comprehensive survey of cryptography key management systems

  2023cites this paper
• Adaptively Secure BLS Threshold Signatures from DDH and co-CDH

  2023cites this paper
• A New Research on Verifiable and Searchable Encryption Scheme Based on Blockchain

  2023cites this paper
• A Low-Round Distributed PRF from Lattices and its Application to Distributed Key Management

  2023cites this paper
• The Legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications

  2023cites this paper
• Chameleon Hash Based Efficiently Updatable Oblivious Key Management

  2023cites this paper
• Blockchain-Based Transparent Integrity Auditing and Encrypted Deduplication for Cloud Storage

  2023cites this paper
• A Secure Client-Side Deduplication Scheme Based on Updatable Server-Aided Encryption

  2023cites this paper
• Scaling Mobile Private Contact Discovery to Billions of Users

  2023cites this paper
• Fast pseudorandom quantum state generators via inflationary quantum gates

  2023cites this paper
• A Randomized Bit Generator using Algebraic Number Theory

  2023cites this paper
• Authenticated private information retrieval

  2023cites this paper
• Blockchain-based and Privacy-Preserving Data Collection for Vehicular Crowdsensing

  2023cites this paper
• Constant Input Attribute Based (and Predicate) Encryption from Evasive and Tensor LWE

  2023cites this paper
• DID-based Distributed Verifiable Random Function with Successor Rule-based de Bruijn Sequence in Blockchain

  2023cites this paper
• A Post-Quantum Round-Optimal Oblivious PRF from Isogenies

  2023cites this paper
• Random Number Generators: Principles and Applications

  2023cites this paper
• Multi-User CDH Problems and the Concrete Security of NAXOS and HMQV

  2023cites this paper
• Deduplication vs Privacy Tradeoffs in Cloud Storage

  2023cites this paper
• Black-Box Constructive Proofs Are Unavoidable

  2023cites this paper
• Trivial Transciphering With Trivium and TFHE

  2023cites this paper
• Smart Contract-based Secure Verifiable Random Function using ChaCha20 Sequence in Blockchain

  2023cites this paper
• A Secure Two-Factor Authentication Scheme From Password-Protected Hardware Tokens

  2022cites this paper
• Iterative Oblivious Pseudo-Random Functions and Applications

  2022influential citation
• dualDup: A secure and reliable cloud storage framework to deduplicate the encrypted data and key

  2022cites this paper