|
| | | | |
| | | |
| Stat |
Members: 3644
Articles: 2'497'992
Articles rated: 2609
16 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Adaptive Concurrent Non-Malleability with Bare Public-Keys | | Andrew C. Yao
; Moti Yung
; Yunlei Zhao
; | | Date: |
17 Oct 2009 | | Abstract: | Concurrent non-malleability (CNM) is central for cryptographic protocols
running concurrently in environments such as the Internet. In this work, we
formulate CNM in the bare public-key (BPK) model, and show that round-efficient
concurrent non-malleable cryptography with full adaptive input selection can be
established, in general, with bare public-keys (where, in particular, no
trusted assumption is made). Along the way, we clarify the various subtleties
of adaptive concurrent non-malleability in the bare public-key model. | | Source: | arXiv, 0910.3282 | | 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 claudebot
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER