Article

Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information

Author:

Ran CanettiAuthors Info & Claims

CRYPTO '97: Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology

Pages 455 - 469

Published: 17 August 1997 Publication History

Abstract

No abstract available.

Cited By

View all

Zhandry M(2019)The Magic of ELFsJournal of Cryptology10.1007/s00145-018-9289-932:3(825-866)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1007/s00145-018-9289-9
Bitansky NVaikuntanathan V(2018)Indistinguishability Obfuscation from Functional EncryptionJournal of the ACM10.1145/323451165:6(1-37)Online publication date: 19-Nov-2018
https://dl.acm.org/doi/10.1145/3234511
Alamélou QBerthier PCachet CCauchie SFuller BGaborit PSimhadri SKim JAhn GKim SKim YLopez JKim T(2018)Pseudoentropic IsometriesProceedings of the 2018 on Asia Conference on Computer and Communications Security10.1145/3196494.3196530(673-684)Online publication date: 29-May-2018
https://dl.acm.org/doi/10.1145/3196494.3196530
Show More Cited By

Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information

Recommendations

Towards Automatic Face Recognition in Unconstrained Scenarios / Zur automatischen Gesichtserkennung in unkontrollierten Bedingungen
Random oracles in a quantum world
ASIACRYPT'11: Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security

The interest in post-quantum cryptography -- classical systems that remain secure in the presence of a quantum adversary -- has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and are proven ...
Limits on the usefulness of random oracles
TCC'13: Proceedings of the 10th theory of cryptography conference on Theory of Cryptography

In the random oracle model, parties are given oracle access to a random function (i.e., a uniformly chosen function from the set of all functions), and are assumed to have unbounded computational power (though they can only make a bounded number of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CRYPTO '97: Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology

August 1997

537 pages

ISBN:3540633847

Editor:
Burton S. Kaliski

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 17 August 1997

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

83
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhandry M(2019)The Magic of ELFsJournal of Cryptology10.1007/s00145-018-9289-932:3(825-866)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1007/s00145-018-9289-9
Bitansky NVaikuntanathan V(2018)Indistinguishability Obfuscation from Functional EncryptionJournal of the ACM10.1145/323451165:6(1-37)Online publication date: 19-Nov-2018
https://dl.acm.org/doi/10.1145/3234511
Alamélou QBerthier PCachet CCauchie SFuller BGaborit PSimhadri SKim JAhn GKim SKim YLopez JKim T(2018)Pseudoentropic IsometriesProceedings of the 2018 on Asia Conference on Computer and Communications Security10.1145/3196494.3196530(673-684)Online publication date: 29-May-2018
https://dl.acm.org/doi/10.1145/3196494.3196530
Gupta DSaia JYoung M(2018)Proof of Work Without All the WorkProceedings of the 19th International Conference on Distributed Computing and Networking10.1145/3154273.3154333(1-10)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3154273.3154333
Boneh DZhandry M(2017)Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability ObfuscationAlgorithmica10.1007/s00453-016-0242-879:4(1233-1285)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s00453-016-0242-8
Bitansky NCanetti RKalai YPaneth O(2017)On Virtual Grey Box Obfuscation for General CircuitsAlgorithmica10.1007/s00453-016-0218-879:4(1014-1051)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s00453-016-0218-8
Bitansky NCanetti RChiesa AGoldwasser SLin HRubinstein ATromer E(2017)The Hunting of the SNARKJournal of Cryptology10.1007/s00145-016-9241-930:4(989-1066)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s00145-016-9241-9
Kiltz EO'neill ASmith A(2017)Instantiability of RSA-OAEP Under Chosen-Plaintext AttackJournal of Cryptology10.1007/s00145-016-9238-430:3(889-919)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1007/s00145-016-9238-4
Brakerski ZRothblum G(2017)Obfuscating ConjunctionsJournal of Cryptology10.1007/s00145-015-9221-530:1(289-320)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1007/s00145-015-9221-5
Canetti RFuller BPaneth OReyzin LSmith A(2016)Reusable Fuzzy Extractors for Low-Entropy DistributionsProceedings, Part I, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 966510.5555/3081770.3081775(117-146)Online publication date: 8-May-2016
https://dl.acm.org/doi/10.5555/3081770.3081775
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Towards Automatic Face Recognition in Unconstrained Scenarios / Zur automatischen Gesichtserkennung in unkontrollierten Bedingungen

Random oracles in a quantum world

Limits on the usefulness of random oracles

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations