640 Hits in 3.3 sec

Foundations of Non-malleable Hash and One-Way Functions [chapter]

Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi
2009 Lecture Notes in Computer Science  
We also discuss the complexity of non-malleable hash and one-way functions.  ...  We then show that non-malleability for hash and one-way functions can be achieved, via a theoretical construction that uses perfectly one-way hash functions and simulation-sound non-interactive zero-knowledge  ...  Marc Fischlin is supported by the Emmy Noether Program Fi 940/2-1 of the German Research Foundation (DFG).  ... 
doi:10.1007/978-3-642-10366-7_31 fatcat:vvtnmsrcq5czje2ekixzebcsey

Expedient Non-malleability Notions for Hash Functions [chapter]

Paul Baecher, Marc Fischlin, Dominique Schröder
2011 Lecture Notes in Computer Science  
Here we take a different, more handy approach to non-malleability of hash functions.  ...  Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values.  ...  The authors are supported by the Emmy Noether Grant Fi 940/2-1 of the German Research Foundation (DFG).  ... 
doi:10.1007/978-3-642-19074-2_18 fatcat:bovswhil35avvcx7bj2bdbow6i

Non-Malleable Functions and Their Applications [chapter]

Yu Chen, Baodong Qin, Jiang Zhang, Yi Deng, Sherman S. M. Chow
2016 Lecture Notes in Computer Science  
We formally study "non-malleable functions" (NMFs), a general cryptographic primitive which simplifies and relaxes "non-malleable one-way/hash functions" (NMOWHFs) introduced by Boldyreva et al.  ...  We investigate the relations between non-malleability and one-wayness.  ...  We are grateful to Qiong Huang, Marc Fischlin, Jinyong Chang, and Fei Tang for helpful discussions and advice. We also thank the anonymous reviewers of PKC 2016 for their useful comments.  ... 
doi:10.1007/978-3-662-49387-8_15 fatcat:fc7qyoytxvaarmahujzjw4noxm

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 additionally only requires a constant number of rounds and is based only on (black-box use of) one-way functions.  ...  All of the mentioned results make only a black-box use of one-way functions.  ...  This allows us to get a non-malleable statistically hiding commitment in constant rounds based on (a black-box use of) collision resistant hash functions.  ... 
doi:10.1109/focs.2012.47 dblp:conf/focs/GoyalLOV12 fatcat:hvd2iqbhyffe7ngxuh3ojuleoi

Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions [chapter]

Rafael Pass, Hoeteck Wee
2010 Lecture Notes in Computer Science  
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security.  ...  As far as we know, this is the first construction of a constant-round non-malleable protocol based on only one-wayness, or to admit a black-box proof of security under any standard-type assumption.  ...  We thank Vinod Vaikuntanathan for an inspiring discussion on non-malleability.  ... 
doi:10.1007/978-3-642-13190-5_32 fatcat:t52rglicxnaetlku4lybxfzunu

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)  
based only on one-way functions, and even 3-round concurrent non-malleable commitments based on subexponential one-way functions.  ...  Assume the existence of a non-interactive commitments, a ZAP, a family of collision-resistant hash functions, all with subexponential-security, and the existence of a (T, B)-time-lock puzzle.  ...  The current state-of-the-art is that 4-round concurrent non-malleable commitments can constructed based on one-way functions [COSV16a] and 3-round concurrent non-malleable commitments can be constructed  ... 
doi:10.1109/focs.2017.59 dblp:conf/focs/LinPS17 fatcat:p5tfdt6wibcu7et64ngkuojvce

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

Chunhui Wu, Qin Li, Dongyang Long
2015 Journal of Communications  
We first give two constructions of (full) ID-based trapdoor commitment schemes based on RSA and Factoring assumptions respectively and then extend them to non-malleable schemes.  ...  In this paper, we focus on the non-malleability in ID-based trapdoor commitments.  ...  They present a non-malleable public-key encryption scheme (based on any trapdoor permutation) and a non-malleable commitment scheme with logarithmically many rounds based on any one-way function.  ... 
doi:10.12720/jcm.10.5.330-338 fatcat:gxmfmrarindv7ffxjggj4bn7va

On the Security of OAEP [chapter]

Alexandra Boldyreva, Marc Fischlin
2006 Lecture Notes in Computer Science  
Namely, we show that instantiating both random oracles in OAEP by modest functions implies non-malleability under chosen plaintext attacks for random messages.  ...  We first show that partial instantiations, where one of the two random oracles used in OAEP is instantiated by a function family, can be provably secure (still in the random oracle model).  ...  Part of the work done while both authors were visiting Centre de Recerca Matematica (CRM) and Technical  ... 
doi:10.1007/11935230_14 fatcat:7sexexxrtneztlagkrff2mutwa

Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity [chapter]

Akinori Kawachi, Christopher Portmann, Keisuke Tanaka
2011 Lecture Notes in Computer Science  
We define approximate non-malleability by relaxing the security conditions and only requiring non-malleability to hold with high probability (over the choice of secret key), and show that any authentication  ...  We compare this notion of security to secrecy and authenticity, and provide a complete characterization of their relative strengths.  ...  By Theorem 5.2 this implies that a family of ASU 2 hash functions provides 3ε/2-approximate strong non-malleability and 3ε/2-approximate non-malleability. Bierbrauer et al.  ... 
doi:10.1007/978-3-642-20728-0_2 fatcat:t5rcxtzugza4rifciu7oqfttpm

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.  ...  I would like to thank Rafael Pass for numerous insightful discussions and his constant encouragement as well as the staff at Ninth Street Espresso for their hospitality.  ... 
doi:10.1109/focs.2010.87 dblp:conf/focs/Wee10 fatcat:fqfmr3o2nza5nj5f2pavubqd5a

Tamper and Leakage Resilience in the Split-State Model [chapter]

Feng-Hao Liu, Anna Lysyanskaya
2012 Lecture Notes in Computer Science  
Our construction is simple and modular, and relies on a new construction, in the CRS model, of non-malleable codes with respect to split-state tampering functions, which may be of independent interest.  ...  We note that prior negative results show that it is impossible to algorithmically secure a cryptographic functionality against a combination of arbitrary continual leakage and tampering attacks without  ...  Anna Lysyanskaya was supported by NSF grants 1012060, 0964379, 0831293, and by a Sloan Foundation fellowship.  ... 
doi:10.1007/978-3-642-32009-5_30 fatcat:juxbandfgrg3vgciamk5zfc3ti

Block-Wise Non-Malleable Codes

Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, Jalaj Upadhyay, Marc Herbstritt
2016 International Colloquium on Automata, Languages and Programming  
Damgård and Groth [14] showed non-interactive non-malleable commitments based on only one-way functions in presence of some trusted infras- tructure.  ...  Lin and Pass [28] showed an almost constant round non-malleable commitment scheme based on one-way functions and had a black-box proof of security.  ... 
doi:10.4230/lipics.icalp.2016.31 dblp:conf/icalp/ChandranGMPU16 fatcat:qgc7wrectrgsrbimivtyfd7w7q

User-aided data authentication

Sven Laur, Sylvain Pasini
2009 International Journal of Security and Networks (IJSN)  
In particular, we give a unified treatment of many previous results and outline common design principles.  ...  All classical authentication protocols are based on pre-shared authentic information such as long-term secret keys or a public key infrastructure.  ...  Acknowledgments Partially supported by the Academy of Finland and by the Estonian Doctoral School in Information and Communication Technology.  ... 
doi:10.1504/ijsn.2009.023427 fatcat:7oyxukrharalrewf3d7a4amdjy

Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks [chapter]

Mihir Bellare, David Cash
2010 Lecture Notes in Computer Science  
This paper fills an important foundational gap with the first proofs, under standard assumptions and in the standard model, of the existence of pseudorandom functions (PRFs) and pseudorandom permutations  ...  Yet ours are the first significant proofs of existence of secure constructs. We warn that our constructs are proofs-of-concept in the foundational style and not practical.  ...  We thank Mira and Tolga Acar for discussions on the practical relevance of RKAs that rekindled the first author's interest in this area.  ... 
doi:10.1007/978-3-642-14623-7_36 fatcat:trxt6lojhjecrbxvw23hvkieji

Black-Box Constructions of Two-Party Protocols from One-Way Functions [chapter]

Rafael Pass, Hoeteck Wee
2009 Lecture Notes in Computer Science  
NP and non-malleable commitments starting from only one-way functions. protocols.  ...  Previous constructions either require stronger computational assumptions (e.g. collision-resistant hash functions), non-black-box access to a one-way function, or a super-constant number of rounds.  ...  It follows from the analysis in [33] that the resulting O(n)-round commitment scheme is one-many non-malleable.  ... 
doi:10.1007/978-3-642-00457-5_24 fatcat:lbsvw7uyqnalfmzbajqu2lxki4
« Previous Showing results 1 — 15 out of 640 results