Filters








6,938 Hits in 3.5 sec

Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin
2009 Journal of Cryptology  
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly available RSA or Discrete-Log  ...  We also discuss the difference between the notion of non-malleable commitment schemes used by Dolev, Dwork and Naor [DDN00] and the one given by Di Crescenzo, Ishai and Ostrovsky [DIO98] .  ...  Acknowledgments We are indebted to Cynthia Dwork for discussions about non-malleability.  ... 
doi:10.1007/s00145-009-9045-2 fatcat:lhomi6esuja7rayqelwekvihau

Efficient Non-malleable Commitment Schemes [chapter]

Marc Fischlin, Roger Fischlin
2000 Lecture Notes in Computer Science  
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly available RSA or Discrete-Log  ...  We also discuss the difference between the notion of non-malleable commitment schemes used by Dolev, Dwork and Naor [DDN00] and the one given by Di Crescenzo, Ishai and Ostrovsky [DIO98] .  ...  Acknowledgments We are indebted to Cynthia Dwork for discussions about non-malleability.  ... 
doi:10.1007/3-540-44598-6_26 fatcat:qnhjf6ijmjefjllsqf2x6izyfy

Efficient Non-Malleable Commitment Schemes

Marc Fischlin, Roger Fischlin
2009 Journal of Cryptology  
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly available RSA or Discrete-Log  ...  We also discuss the difference between the notion of non-malleable commitment schemes used by Dolev, Dwork and Naor [DDN00] and the one given by Di Crescenzo, Ishai and Ostrovsky [DIO98] .  ...  Acknowledgments We are indebted to Cynthia Dwork for discussions about non-malleability.  ... 
doi:10.1007/s00145-009-9043-4 fatcat:4ul2xs466ngutebmgtwehzjebq

An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme

Seiko ARITA
2011 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
It is known that composable secure commitments, that is, concurrent non-malleable commitments exist in the plain model, based only on standard assumptions such as the existence of claw-free permutations  ...  However, those schemes cannot be said to be practically efficient.  ...  non-malleable commitment scheme.  ... 
doi:10.1587/transfun.e94.a.367 fatcat:w2o5fxqb6fel3gudzciy4wry4i

Efficient ID-based Non-Malleable Trapdoor Commitments Based on RSA and Factoring

Chunhui Wu, Qin Li, Dongyang Long
2015 Journal of Communications  
In this paper, we focus on the non-malleability in ID-based trapdoor commitments.  ...  Abstract-Non-malleability is an important property in commitment schemes. It can resist to the person-in-the-middle (PIM) attacks within the interaction.  ...  The Proposed ID-Based Non-Malleable Trapdoor Commitment In this section, we extend the scheme in Section IIIA to a non-malleable scheme.  ... 
doi:10.12720/jcm.10.5.330-338 fatcat:gxmfmrarindv7ffxjggj4bn7va

Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations [chapter]

Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran
2015 Lecture Notes in Computer Science  
We show that non-malleable string commitments can be "entirely based on" non-malleable bit commitments.  ...  We construct an explicit, efficient non-malleable code for arbitrarily long messages in this model (unconditionally).  ...  scheme yields a r-round non-malleable string-commitment scheme.  ... 
doi:10.1007/978-3-662-47989-6_26 fatcat:j65vikz5nvfe7f6f6hrkvnrnzu

Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification

Hoeteck Wee
2010 2010 IEEE 51st Annual Symposium on Foundations of Computer Science  
In addition to the results on secure computation, we also obtain a simple construction of a O(log * n)-round non-malleable commitment scheme based on one-way functions, improving upon the recent O(1) log  ...  Our constructions build on and improve upon the work of Lin and Pass (STOC 2009) on non-malleability amplification, as well as that of Ishai et al. (STOC 2006) on black-box secure computation.  ...  a many-many non-malleable commitment scheme for t parties into a one-one nonmalleable commitment scheme for 2 t−1 parties; the second transforms a one-one non-malleable commitment scheme into a many-many  ... 
doi:10.1109/focs.2010.87 dblp:conf/focs/Wee10 fatcat:fqfmr3o2nza5nj5f2pavubqd5a

Efficient and Non-interactive Non-malleable Commitment [chapter]

Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith
2001 Lecture Notes in Computer Science  
Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit  ...  Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly  ...  Thanks to Yehuda Lindell for pointing out that an NM-CPA scheme is sufficient in the construction of Section 3.  ... 
doi:10.1007/3-540-44987-6_4 fatcat:kz3iy3mvardhlao64xkfe5nrle

Fast Non-Malleable Commitments

Hai Brenner, Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
Despite two decades of research, non-malleable commitments (NMCs) have remained too inefficient to be implemented in practice, without some sort of trusted setup.  ...  The notion of non-malleability in cryptography refers to the setting where the adversary is a man-in-the-middle (MIM) who takes part in two or more protocol executions and tries to use information obtained  ...  Figure 2 : 2 Constant Rate Non-malleable commitment scheme C, R AMOR .  ... 
doi:10.1145/2810103.2813721 dblp:conf/ccs/BrennerGRRV15 fatcat:bjl3gglgobcodah7j4aapqm2ra

Constructing Non-malleable Commitments: A Black-Box Approach

Vipul Goyal, Chen-Kuei Lee, Rafail Ostrovsky, Ivan Visconti
2012 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science  
Our construction relies on (and can be seen as a generalization of) the recent non-malleable commitment scheme of Goyal (STOC 2011).  ...  We propose the first black-box construction of non-malleable commitments according to the standard notion of non-malleability with respect to commitment.  ...  We use the notion of non-malleability with respect to commitment from [1] for statistically binding non-malleable commitment schemes.  ... 
doi:10.1109/focs.2012.47 dblp:conf/focs/GoyalLOV12 fatcat:hvd2iqbhyffe7ngxuh3ojuleoi

Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments [chapter]

Zhenfu Cao, Ivan Visconti, Zongyang Zhang
2010 Lecture Notes in Computer Science  
They constructed a constant-round commitment scheme that is concurrent non-malleable with respect to both commitment and decommitment. However, the scheme is only computationally binding.  ...  When commitment schemes are used in complex environments, e.g., the Internet, the issue of malleability appears, i.e., a concurrent man-in-the-middle adversary might generate commitments to values related  ...  ,vm)∈{0,1} n * m ,z∈{0,1} * A commitment scheme that is non-malleable according to Definition 2 is liberal non-malleable rather than strict non-malleable [1, 3] .  ... 
doi:10.1007/978-3-642-13013-7_12 fatcat:gop3ltnqhjdzxmu2zvpebl63xq

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

Huijia Lin, Rafael Pass, Pratik Soni
2017 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)  
Our Results Our main result demonstrates the existence of a two-round concurrent non-malleable commitment scheme based on sub-exponential "standard-type" assumptions-notably, assuming the existence of  ...  Then, there exists a 2-round concurrent non-malleable commitment.  ...  Non-malleable Commitment Scheme w.r.t.  ... 
doi:10.1109/focs.2017.59 dblp:conf/focs/LinPS17 fatcat:p5tfdt6wibcu7et64ngkuojvce

A Straight-Line Extractable Non-malleable Commitment Scheme

S. ARITA
2007 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
non-malleable commitment schemes.  ...  Known Non-malleable Commitment Schemes There are some known non-malleable commitment schemes. Crescenzo et al. [2] constructed a non-interactive and nonmalleable commitment scheme.  ...  This means non-malleability of the commitment scheme.  ... 
doi:10.1093/ietfec/e90-a.7.1384 fatcat:w7llealhmvf6zch67qpe4ztula

Independent Zero-Knowledge Sets [chapter]

Rosario Gennaro, Silvio Micali
2006 Lecture Notes in Computer Science  
Our efficient constructions of independent ZKS protocols requires the design of new commitment schemes that are simultaneously independent (and thus non-malleable) and mercurial. that can be carried on  ...  The first non-malleable commitment scheme was presented in [11], but it required several rounds of communication.  ...  Indeed all the known non-interactive non-malleable commitment schemes are in this model.  ... 
doi:10.1007/11787006_4 fatcat:yhouohey6fb6lkd7a6aq7vy7um

Non-malleability amplification

Huijia Lin, Rafael Pass
2009 Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09  
We show a technique for amplifying commitment schemes that are non-malleable with respect to identities of length t, into ones that are non-malleable with respect to identities of length Ω(2 t ), while  ...  Then there exists a O(log * n)-round non-malleable commitment with a black-box proof of security.  ...  Let C, R be a commitment scheme, and B a PPT ITM. We say the commitment scheme C, R is one-many non-malleable w.r.t.  ... 
doi:10.1145/1536414.1536442 dblp:conf/stoc/LinP09 fatcat:2f6px4gccvbkbhowglaw2evolm
« Previous Showing results 1 — 15 out of 6,938 results