DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Michael Luby
Michael Luby
Practical Parallel Hypergraph Algorithms
Practical Forward Secure Signatures Using Minimal Security Assumptions
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
Counter-Mode Encryption (“CTR Mode”) Was Introduced by Diffie and Hellman Already in 1979 [5] and Is Already Standardized By, for Example, [1, Section 6.4]
The Cryptographic Impact of Groups with Infeasible Inversion Susan Rae
Chromatic Scheduling of Dynamic Data-Graph
A Digital Fountain Retrospective
David Middleton
IN the SUPREME COURT of OHIO STATE of OHIO, Ex Rel. Michael T
Seven-Property-Preserving Iterated Hashing: ROX
Mobile Communications ECS
Compression of Samplable Sources
Randomization Techniques for Secure Computation, Yuval Ishai, 2013
Novel Frameworks for Mining Heterogeneous and Dynamic
Digital Communication Systems ECS 452
Principles of Communications ECS 332
One-Way Functions Exist Iff K -Complexity Is Hard-On-Average
Homomorphic Encryption Random Beacon
Top View
XMSS – a Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
Conference Info & Program
Post-Quantum Hash-Based Signatures for Multi-Chain Blockchain Technologies
G-Merkle: a Hash-Based Group Signature Scheme from Standard Assumptions
The Complexity of Public-Key Cryptography
Bibliography
Paweł Korus Analysis of Image Reconstruction Schemes Based on Self-Embedding and Digital Watermarking
A SIMPLE PARALLEL ALGORITHM ,FOR the MAXIMAL INDEPENDENT SET PROBLEM* MICHAEL Lubyf
A New View on Worst-Case to Average-Case Reductions for NP
The 2014 Noticesindex
Coding Theory Days in St. Petersburg
Simulatable Adaptive Oblivious Transfer
XMSS – a Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions Second Version, 26
The Complexity of Zero Knowledge
The Complexity of Public-Key Cryptography