Amanote Research
Register
Sign In
Lower Bounds on the Efficiency of Generic Cryptographic Constructions
doi 10.1109/sfcs.2000.892119
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
R. Gennaro
L. Trevisan
Publisher
IEEE Comput. Soc
Related search
Provably Secure Cryptographic Constructions
Underapproximation for Model-Checking Based on Random Cryptographic Constructions
Generic Constructions for Verifiable Signcryption
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower Bounds
On Lower Bounds for the Kirchhoff Index
Kragujevac Journal of Science
On Lower Bounds of Exponential Frames
Journal of Fourier Analysis and Applications
Mathematics
Applied Mathematics
Analysis
Bounds and Constructions for Metering Schemes
Communications in Information and Systems
Lower Bounds on the Hausdorff Measure of Nodal Sets
Mathematical Research Letters
Mathematics
On Lower Bounds for the Ihara Constants and
Compositio Mathematica
Number Theory
Algebra
