|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
27 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Cryptography and Algorithmic Randomness | | Kohtaro Tadaki
; Norihisa Doi
; | | Date: |
12 Apr 2013 | | Abstract: | The secure instantiation of the random oracle is one of the major open
problems in modern cryptography. We investigate this problem using concepts and
methods of algorithmic randomness. In modern cryptography, the random oracle
model is widely used as an imaginary framework in which the security of a
cryptographic scheme is discussed. In the random oracle model, the
cryptographic hash function used in a cryptographic scheme is formulated as a
random variable uniformly distributed over all possibility of the function,
called the random oracle. The main result of this paper is to show that, for
any secure signature scheme in the random oracle model, there exists a specific
computable function which can instantiate the random oracle while keeping the
security originally proved in the random oracle model. In modern cryptography
the generic group model is used also for a similar purpose to the random oracle
model. We show that the same results hold for the generic group model. In the
process of proving the results, we introduce the notion of effective security,
demonstrating the importance of this notion in modern cryptography. | | Source: | arXiv, 1305.2391 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER