Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Huijia Lin, Rafael Pass, Pratik Soni. Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. pages 576-587, IEEE Computer Society, 2017. [doi]

This author has not been identified. Look up 'Huijia Lin' in GoogleThis author has not been identified. Look up 'Rafael Pass' in GoogleThis author has not been identified. Look up 'Pratik Soni' in Google

runs on WebDSL