Adaptive Concurrent Non-Malleability with Bare Public-Keys

Details Adaptive Concurrent Non-Malleability with Bare Public-Keys Adaptive Concurrent Non-Malleability with Bare Public-Keys

2009-10-17

arxiv.org/abs/0910.3282v1

Computer Science

Computational Complexity

41 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Adaptive Concurrent Non-Malleability with Bare Public-Keys does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adaptive Concurrent Non-Malleability with Bare Public-Keys, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Concurrent Non-Malleability with Bare Public-Keys will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-89571