OpenAlex
PricingAboutJobs
Log inGet started
Work

Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?

HTML

Year: 1998
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Advances in Cryptology — EUROCRYPT'98: International Conference on the Theory and Application of Cryptographic Techniques Espoo, Finland, May 31 – June 4, 1998 Proceedings
DOI: 10.1007/bfb0054137
Author: Daniel R. Simon
Institution: Microsoft (United States)
Language: English

Topic: Cryptography and Data Security
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Keywords: one-way permutations, relativization, black-box reductions, cryptographic primitives, oracle construction, cryptographic hash functions, cryptographic assumptions

Open Access status: closed
OpenAlex ID: W1499074627
FWCI: 2.493
Cites: 19
Cited by: 318
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms