Higher　security　and　lower　collision　rate　have　always　been　people＇s　pursuits　in　the　construction　of　hash　functions.　We　consider　a　quantum　walk　where　a　walker　is　driven　by　two　coins　alternately.　At　each　step,　a　message　bit　decides　whether　to　swap　two　coins.　In　this　way,　a　keyed　hash　function　is　constructed.　Theoretically　infinite　possibilities　of　the　initial　parameters　as　the　key　ensure　the　security　of　the　proposed　hash　function　against　the　unforgery　and　collision　resistance.　Finally,　we　establish　a　generic　quantum　walk-based　hash　function　model　and　give　a　guide　in　constructing　hash　functions　in　quantum　walk　architecture.　It　also　provides　a　clue　for　the　construction　of　other　quantum　walk-based　cryptography　protocols.