Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
One Way Hash Functions and DES
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Seven-property-preserving iterated hashing: ROX
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Indifferentiable security analysis of popular hash functions with prefix-free padding
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Multi-property-preserving hash domain extension and the EMD transform
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
A failure-friendly design principle for hash functions
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Merkle-Damgård revisited: how to construct a hash function
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Second preimages on n-bit hash functions for much less than 2n work
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Herding hash functions and the nostradamus attack
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Slide Attacks on a Class of Hash Functions
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Twister --- A Framework for Secure and Fast Hash Functions
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
The State of Hash Functions and the NIST SHA-3 Competition
Information Security and Cryptology
ISC '09 Proceedings of the 12th International Conference on Information Security
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Preimage resistance of LPm kr with r=m-1
Information Processing Letters
Whirlwind: a new cryptographic hash function
Designs, Codes and Cryptography
TWISTERπ – a framework for secure and fast hash functions
International Journal of Applied Cryptography
Proceedings of the 3rd international conference on Security of information and networks
Security analysis of the mode of JH hash function
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Higher order differential attack on step-reduced variants of Luffa v1
FSE'10 Proceedings of the 17th international conference on Fast software encryption
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Sponge-based pseudo-random number generators
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
On the indifferentiability of the Grøstl hash function
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Some observations on indifferentiability
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
A lightweight implementation of Keccak hash function for radio-frequency identification applications
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Security reductions of the second round SHA-3 candidates
ISC'10 Proceedings of the 13th international conference on Information security
Careful with composition: limitations of the indifferentiability framework
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
On the indifferentiability of fugue and luffa
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
The NIST SHA-3 competition: a perspective on the final year
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Finding collisions for reduced Luffa-256 v2
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
The PHOTON family of lightweight Hash functions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
SPONGENT: a lightweight hash function
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Efficient hashing using the AES instruction set
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
The first 30 years of cryptographic hash functions and the NIST SHA-3 competition
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Duplexing the sponge: single-pass authenticated encryption and other applications
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Compact FPGA implementations of the five SHA-3 finalists
CARDIS'11 Proceedings of the 10th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Practical analysis of reduced-round keccak
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Security analysis and comparison of the SHA-3 finalists BLAKE, grøstl, JH, keccak, and skein
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
The GLUON family: a lightweight hash function family based on FCSRs
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Indifferentiability of domain extension modes for hash functions
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Differential propagation analysis of keccak
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
On the implementation aspects of sponge-based authenticated encryption for pervasive devices
CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications
Multipurpose cryptographic primitive ARMADILLO3
CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
The SHA-3 competition: lessons learned
Proceedings of the 6th International Conference on Security of Information and Networks
BLAKE2: simpler, smaller, fast as MD5
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Cryptophia's short combiner for collision-resistant hash functions
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Security of permutation-based compression function lp231
Information Processing Letters
| Hi-index | 0.00 |
In this paper we prove that the sponge construction introduced in [4] is indifferentiable from a random oracle when being used with a random transformation or a random permutation and discuss its implications. To our knowledge, this is the first time indifferentiability has been shown for a construction calling a random permutation (instead of an ideal compression function or ideal block cipher) and for a construction generating outputs of any length (instead of a fixed length).