Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudo-random functions and factoring (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Provably authenticated group Diffie-Hellman key exchange
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves
Designs, Codes and Cryptography
Verifiable Partial Escrow of Integer Factors
Designs, Codes and Cryptography
A Secure Fault-Tolerant Conference-Key Agreement Protocol
IEEE Transactions on Computers
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
One-Round Secure Computation and Secure Autonomous Mobile Agents
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Group Diffie-Hellman Problems
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
On the Minimal Hardware Complexity of Pseudorandom Function Generators
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Oblivious Transfer with Adaptive Queries
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
An Improved Pseudo-random Generator Based on Discrete Log
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Optimistic Fair Secure Computation
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On the (Im)possibility of Obfuscating Programs
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Pseudorandomness from Braid Groups
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A Threshold Pseudorandom Function Construction and Its Applications
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Min-round Resettable Zero-Knowledge in the Public-Key Model
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Priced Oblivious Transfer: How to Sell Digital Goods
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Traitor Tracing with Constant Transmission Rate
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
The Modular Inversion Hidden Number Problem
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Key-Privacy in Public-Key Encryption
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Revocation Scheme with Minimal Storage at Receivers
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Trace and Revoke Schemes
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Practical Oblivious Transfer Protocols
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Efficient State Updates for Key Management
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
High-Speed Pseudorandom Number Generation with Small Memory
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison
ISC '01 Proceedings of the 4th International Conference on Information Security
Multi-recipient Public-Key Encryption with Shortened Ciphertext
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Linear Code Implies Public-Key Traitor Tracing
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Efficient Construction of (Distributed) Verifiable Random Functions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Randomness Re-use in Multi-recipient Encryption Schemeas
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds
Computational Complexity
An asynchronous protocol for distributed computation of RSA inverses and its applications
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
Improved efficiency for revocation schemes via Newton interpolation
ACM Transactions on Information and System Security (TISSEC)
Provably secure authenticated group Diffie-Hellman key exchange
ACM Transactions on Information and System Security (TISSEC)
Designs, Codes and Cryptography
The complexity of properly learning simple concept classes
Journal of Computer and System Sciences
Verifiable Random Functions from Identity-Based Key Encapsulation
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Optimal Randomness Extraction from a Diffie-Hellman Element
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
Theoretical Computer Science
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
Proceedings of the 16th ACM conference on Computer and communications security
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Pseudorandom function tribe ensembles based on one-way permutations: improvements and applications
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Public-key encryption in a multi-user setting: security proofs and improvements
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Using hash functions as a hedge against chosen ciphertext attack
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Minimal-latency secure function evaluation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A theoretical treatment of related-key attacks: RKA-PRPS, RKA-PRFs, and applications
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Pirate evolution: how to make the most of your traitor keys
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A security analysis of the NIST SP 800-90 elliptic curve random number generator
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A generalization of DDH with applications to protocol analysis and computational soundness
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Tweakable enciphering schemes from hash-sum-expansion
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Algebraic pseudorandom functions with improved efficiency from the augmented cascade
Proceedings of the 17th ACM conference on Computer and communications security
Collaborative, privacy-preserving data aggregation at scale
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Parallel shuffling and its application to prêt à voter
EVT/WOTE'10 Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections
Access controls for oblivious and anonymous systems
ACM Transactions on Information and System Security (TISSEC)
On the effects of pirate evolution on the design of digital content distribution systems
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Leftover Hash Lemma, revisited
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
A verifiable random function with short proofs and keys
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Relationships between diffie-hellman and “index oracles”
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
ISC'05 Proceedings of the 8th international conference on Information Security
On the (im)possibility of obfuscating programs
Journal of the ACM (JACM)
Efficient set operations in the presence of malicious adversaries
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
k-times anonymous authentication with a constant proving cost
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Provably-Secure two-round password-authenticated group key exchange in the standard model
IWSEC'06 Proceedings of the 1st international conference on Security
Threshold and proactive pseudo-random permutations
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Hybrid symmetric encryption using known-plaintext attack-secure components
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Expanding weak PRF with small key size
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Hardness preserving constructions of pseudorandom functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Message authentication, revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Public key encryption without random oracle made truly practical
Computers and Electrical Engineering
On the Uniformity of Distribution of the Naor-Reingold Pseudo-Random Function
Finite Fields and Their Applications
On the Distribution of the Diffie-Hellman Pairs
Finite Fields and Their Applications
DDH-Like assumptions based on extension rings
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
On the privacy of concealed data aggregation
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Domain-Specific pseudonymous signatures for the german identity card
ISC'12 Proceedings of the 15th international conference on Information Security
Algebraic (trapdoor) one-way functions and their applications
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Outsourced symmetric private information retrieval
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
DupLESS: server-aided encryption for deduplicated storage
SEC'13 Proceedings of the 22nd USENIX conference on Security
Candidate weak pseudorandom functions in AC0 ○ MOD2
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
We describe efficient constructions for various cryptographic primitives (both in private-key and in public-key cryptography). We show these constructions to be at least as secure as the decisional version of the Diffie-Hellman assumption or as the assumption that factoring is hard. Our major result is a new construction of pseudo-random functions such that computing their value at any given point involves two multiple products. This is much more efficient than previous proposals. Furthermore, these functions have the advantage of being in TC/sup 0/ (the class of functions computable by constant depth circuits consisting of a polynomial number of threshold gates) which has several interesting applications. The simple algebraic structure of the functions implies additional features. In particular, we show a zero-knowledge proof for statements of the form "y=f/sub s/(x)" and "y/spl ne/f(x)" given a commitment to a key s of a pseudo-random function f/sub s/.