Moderately Hard Functions: Definition, Instantiations, and Applications
作者： Joël Alwen , Björn Tackmann
DOI: 10.1007/978-3-319-70500-2_17
关键词: Function (engineering) 、 Interface (Java) 、 Theoretical computer science 、 Password protection 、 Property (philosophy) 、 Hash function 、 Cryptography 、 Computer science
摘要: Several cryptographic schemes and applications are based on functions that both reasonably efficient to compute moderately hard invert, including client puzzles for Denial-of-Service protection, password protection via salted hashes, or recent proof-of-work blockchain systems. Despite their wide use, a definition of this concept has not yet been distilled formalized explicitly. Instead, either the proven directly assumptions underlying function, some property function is proven, but security application argued only informally. The goal work provide (universal) decouples efforts designing new building protocols them, serving as an interface between two.
springer.com
sci-hub.se 参考文章(48)
Grégory Demay, Peter Gaži, Martin Hirt, Ueli Maurer, Resource-Restricted Indifferentiability theory and application of cryptographic techniques. pp. 664- 683 ,(2013) , 10.1007/978-3-642-38348-9_39
Ari Juels, John G. Brainard, Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks. network and distributed system security symposium. ,(1999)
Alex Biryukov, Dmitry Khovratovich, Tradeoff Cryptanalysis of Memory-Hard Functions Advances in Cryptology – ASIACRYPT 2015. ,vol. 2015, pp. 633- 657 ,(2015) , 10.1007/978-3-662-48800-3_26
Juan Garay, Aggelos Kiayias, Nikos Leonardos, The Bitcoin Backbone Protocol: Analysis and Applications theory and application of cryptographic techniques. pp. 281- 310 ,(2015) , 10.1007/978-3-662-46803-6_10
Frances F. Yao, Yiqun Lisa Yin, Design and Analysis of Password-Based Key Derivation Functions Lecture Notes in Computer Science. pp. 245- 261 ,(2005) , 10.1007/978-3-540-30574-3_17
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan Warinschi, Security Notions and Generic Constructions for Client Puzzles international conference on the theory and application of cryptology and information security. pp. 505- 523 ,(2009) , 10.1007/978-3-642-10366-7_30
R. Canetti, Universally composable security: a new paradigm for cryptographic protocols international conference on cluster computing. pp. 136- 145 ,(2001) , 10.1109/SFCS.2001.959888
Douglas Stebila, Lakshmi Kuppusamy, Jothi Rangasamy, Colin Boyd, Juan Gonzalez Nieto, Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols the cryptographers track at the rsa conference. pp. 284- 301 ,(2011) , 10.1007/978-3-642-19074-2_19
Adam Back, Hashcash - A Denial of Service Counter-Measure ,(2002)
Stefan Dziembowski, Tomasz Kazana, Daniel Wichs, One-time computable self-erasing functions theory of cryptography conference. pp. 125- 143 ,(2011) , 10.1007/978-3-642-19571-6_9