2 Hits in 12.2 sec

Towards Practical Lattice-Based One-Time Linkable Ring Signatures [chapter]

Carsten Baum, Huang Lin, Sabine Oechsner
2018 Lecture Notes in Computer Science  
We define the ring SIS problem in the canonical embedding (rather than in the standard polynomial representation) and this allows us to get a stronger connection between breaking our binding property and  ...  We show how to instantiate efficient zero-knowledge protocols that can be used to prove a number of relations among these commitments, and apply these in the context of lattice-based threshold cryptosystems  ...  Acknowledgments We thank Nigel Smart for informing us about a bug in an earlier version of this work.  ... 
doi:10.1007/978-3-030-01950-1_18 fatcat:ymdodcwgvzeutgenjzqi4g4omu

Four-Round Concurrent Non-Malleable Commitments from One-Way Functions [chapter]

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti
2017 Lecture Notes in Computer Science  
Later on we have found an error in the security proof (that also applies to the construction of [BGR + 15]) and the claim on concurrent non-malleability has then been withdrawn in the recent eprint version  ...  On the other side, positive results of Goyal [STOC 2011], Lin and Pass [STOC 2011] and Goyal et al.  ...  We also thank Giuseppe Persiano and Alessandra Scafuro for several discussions on delayed-input protocols. The work of 1st, 3rd and 4th authors has been done in part while visiting UCLA.  ... 
doi:10.1007/978-3-319-63715-0_5 fatcat:h52fqyyw5rabhc6morvtmmm6oa