Provably Hard Zero-Way Functions

DOI10.4036/IIS.2002.57MaRDI QIDQ4784455zbMATH OpenOpenAlexFDO

Authors Eikoh Chida, Li Li, Hiroki Shuzuya

Publication date 10 December 2002

Published in Interdisciplinary Information Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4036/iis.2002.57

zbMATH Keywords

complexityone-way functioncryptologyzero-way functions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On hardness of one-way functions
• scientific article; zbMATH DE number 94166
• Zero-Knowledge Proofs
• Zero‐Knowledge Proofs
• Zero knowledge with efficient provers
• scientific article; zbMATH DE number 4191124
• Zero-knowledge proofs for committed symmetric Boolean functions
• The Complexity of Zero Knowledge
• Characterizing deterministic-prover zero knowledge
• scientific article; zbMATH DE number 1559565

This page was built for publication: Provably Hard Zero-Way Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4784455)