56 Hits in 5.2 sec

Security/Efficiency Tradeoffs for Permutation-Based Hashing [chapter]

Phillip Rogaway, John Steinberger
Advances in Cryptology – EUROCRYPT 2008  
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security.  ...  Our results provide guidance when trying to design or analyze practical permutation-based hash functions about the limits of what can possibly be done.  ...  We now show that the pigeonhole attack implies a tradeoff between the (potential) security of a permutation-based hash function and its rate. Proof.  ... 
doi:10.1007/978-3-540-78967-3_13 dblp:conf/eurocrypt/RogawayS08 fatcat:mwu4fl3ipbgpncip7ruo4muy6i

Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions [chapter]

Martijn Stam
Lecture Notes in Computer Science  
This result provides a tradeoff between how many bits you can compress for what level of security given a single call to an n + c-to-n bit random function.  ...  This bound is also relevant for building a m + s-to-s bit compression function based on a blockcipher with k-bit keys and n-bit blocks: simply set c = k, or c = 0 in case of fixed keys.  ...  Introduction Hash function design based on idealized primitives has recently undergone a surge in popularity.  ... 
doi:10.1007/978-3-540-85174-5_22 fatcat:io6dm4x7lnbs5je365rmo4oyau

On the Power of Claw-Free Permutations [chapter]

Yevgeniy Dodis, Leonid Reyzin
2003 Lecture Notes in Computer Science  
Additionally, they can be viewed as the first security/efficiency separation between these basic cryptographic primitives.  ...  More specifically, the "security loss" for general trapdoor permutations is Ω(q hash ), where q hash is the number of random oracle queries made by the adversary (which could be quite large).  ...  In other words, a stronger assumption provides better exact security/efficiency than a weaker one, even though both of them work asymptotically.  ... 
doi:10.1007/3-540-36413-7_5 fatcat:2grg773v6rbvpayyksx2yl6vp4

Comparative Analysis of High Speed and Low Area Architectures of Blake SHA-3 Candidate on FPGA

Muhammad Arsalan, Arshad Aziz
2012 2012 10th International Conference on Frontiers of Information Technology  
Along with the strength of security, efficient hardware implementation is also major evaluation criteria for final selection.  ...  For tradeoff analysis three design optimization techniques based on 'area', 'speed' and 'balance' designs are used.  ...  For tradeoff analysis, each design is implemented using three different optimization strategies, these are "Area", "Speed" and "Balance" design approaches.  ... 
doi:10.1109/fit.2012.51 dblp:conf/fit/ArsalanA12 fatcat:k62b7rtrh5dezpqpuamxkmvxwi

Password-Hashing Status

George Hatzivasilis
2017 Cryptography  
The ordinary option for user-login services [27] are user-originated secrets of eight characters long (8 bytes based on ASCII encoding).  ...  The international cryptographic community conducted the Password Hashing Competition (PHC) to identify new efficient and more secure password-hashing schemes, suitable for widespread adoption.  ...  Argon/Argon2 Optimized for security, efficiency, and clarity, Argon is a safe and memory-hard hash function. It operates as PHS, KDF, and for any other memory-demanding operation.  ... 
doi:10.3390/cryptography1020010 fatcat:klnw5tucinfwfoxwe5zlpsepwi

On the Indifferentiability of Fugue and Luffa [chapter]

Rishiraj Bhattacharyya, Avradip Mandal
2011 Lecture Notes in Computer Science  
To the best of our knowledge, our result for Luffa is the first indifferentiability analysis of a mode of operation based on variable (more than two) number of small permutations.  ...  Indifferentiability is currently considered to be an important security notion for a cryptographic hash function to instantiate Random Oracles in different security proofs.  ...  Specifically, domain extension algorithm of Luffa opens up a interesting research direction regarding security efficiency tradeoff.  ... 
doi:10.1007/978-3-642-21554-4_28 fatcat:7seynuqscrghpoe6ppdmhwjvla

Simpira v2: A Family of Efficient Permutations Using the AES Round Function [chapter]

Shay Gueron, Nicky Mouha
2016 Lecture Notes in Computer Science  
Rogaway, P., Steinberger, J.P.: Security/Efficiency Tradeoffs for Permutation- Based Hashing. In: EUROCRYPT 2008. LNCS, vol. 4965, pp. 220–236. Springer (2008) 72.  ...  Permutation-based hashing. Achieving 128-bit collision resistance with a 128-bit permutation has been shown to be impossible [71].  ... 
doi:10.1007/978-3-662-53887-6_4 fatcat:3wjksrkgqzgo3pg57fpdq6cffu

Self-Encryption Scheme for Data Security in Mobile Devices

Yu Chen, Wei-Shinn Ku
2009 2009 6th IEEE Consumer Communications and Networking Conference  
The most challenging part lies in a dilemma: while it should be computationally infeasible for adversaries to decrypt the data, the cryptographic operation should be efficient for legitimate users and  ...  In order to improve the time-data-memory tradeoff for stream cipher, a concept of Hellman's time-memory tradeoff [4] has been applied and it achieved obvious improvements [12] .  ...  The permutation in this operation is: ) 1 ( ) 2 ( ) 1 ( )! ( ! + − × × − × − × = − = n m m m m n m m P m n L (6) The complexity of this part is O(m n ).  ... 
doi:10.1109/ccnc.2009.4784733 dblp:conf/ccnc/ChenK10 fatcat:nds5olobhncf5cddcrcs7s56si

Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud

Bing Wang, Shucheng Yu, Wenjing Lou, Y. Thomas Hou
2014 IEEE INFOCOM 2014 - IEEE Conference on Computer Communications  
Extensive analysis and experiments on real-world data show that our proposed scheme is secure, efficient and accurate.  ...  In this paper, we propose a novel multikeyword fuzzy search scheme by exploiting the locality-sensitive hashing technique.  ...  Extensive analysis shows that our scheme is secure, efficient and accurate. Experimental results on real-world data validate our claim.  ... 
doi:10.1109/infocom.2014.6848153 dblp:conf/infocom/WangYLH14 fatcat:jcvh5lpggngslerplytrf7x7t4

Blockchain platform with proof-of-work based on analog Hamiltonian optimisers [article]

Kirill P. Kalinin, Natalia G. Berloff
2018 arXiv   pre-print
We discuss the proof-of-work protocols for a few most promising optimiser platforms: quantum annealing hardware based on D-wave simulators and a new class of gain-dissipative simulators.  ...  We propose to use such platforms as a proof-of-work protocol for blockchain technology, which underlies cryptocurrencies providing a way to document the transactions in a permanent decentralised public  ...  Nasdaq is implementing private equity exchange on top of Blockchain with a goal to create a more secure, efficient system to trade stocks [3] .  ... 
arXiv:1802.10091v1 fatcat:244qm2kcjvaflokl3mcte6ol2i

Stam's Collision Resistance Conjecture [chapter]

John Steinberger
2010 Lecture Notes in Computer Science  
For example, a 2n-bit to n-bit compression function making two calls to a random function of n-bit input cannot have collision security exceeding 2 n/3 .  ...  At CRYPTO 2008 Stam [7] made the following conjecture: if an m + s-bit to s-bit compression function F makes r calls to a primitive f of n-bit input, then a collision for F can be obtained (with high probability  ...  Acknowledgements The author would like to thank the referees for their careful read and Greg Kuperberg for helpful discussions.  ... 
doi:10.1007/978-3-642-13190-5_30 fatcat:musg3k5olve47fwswudjthyqjy

A Survey of Provably Secure Searchable Encryption

Christoph Bösch, Pieter Hartel, Willem Jonker, Andreas Peter
2014 ACM Computing Surveys  
We categorize and compare the different SE schemes in terms of their security, efficiency, and functionality.  ...  efficiently in the asymmetric setting remains an open problem.  ...  ACKNOWLEDGMENTS The authors would like to thank Luan Ibraimi, Arjan Jeckmans, Eleftheria Makri, and the anonymous reviewers for their insightful comments.  ... 
doi:10.1145/2636328 fatcat:3ho3qfcufjhopgigvlvh7qwkem

An empirical analysis of the cascade error reconciliation protocol for quantum key distribution

Timothy Calver, Michael Grimaila, Jeffrey Humphries
2011 Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research - CSIIRW '11  
The need to share key material with authorized entities in a secure, efficient and timely manner has driven efforts to develop new key distribution methods. v AFIT/GIR/ENV/11-S01  ...  Hash functions are designed so that the hash cannot be back calculated into the original plaintext.  ...  As opposed to an unbiased method of choosing and measuring bases, the authors recommend using a biased method for choosing the bases.  ... 
doi:10.1145/2179298.2179363 dblp:conf/csiirw/CalverGH11 fatcat:b6j6sgtrindf3edwjiglkfcvee

Building an Encrypted, Distributed, and Searchable Key-value Store

Xingliang Yuan, Xinyu Wang, Cong Wang, Chen Qian, Jianxiong Lin
2016 Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security - ASIA CCS '16  
To enable secure search queries for secondary attributes of data, we leverage searchable symmetric encryption to design the encrypted secondary indexes which consider security, efficiency, and data locality  ...  Modern distributed key-value stores are offering superior performance, incremental scalability, and fine availability for data-intensive computing and cloud-based applications.  ...  The proposed encrypted store is simple yet secure, efficient and scalable.  ... 
doi:10.1145/2897845.2897852 dblp:conf/ccs/YuanWWQL16 fatcat:67ox2tjq4vbhfkanccgf6x7324


Ronghua Wang, Wenliang Du, Xiaogang Liu, Peng Ning
2009 ACM transactions on sensor networks  
We describe a progressive key distribution scheme that is secure, efficient, and packet-loss resilient.  ...  It is impractical to use PKC in the conventional ways for broadcast authentication in sensor networks.  ...  Our scheme is secure, efficient, and packet loss resilient.  ... 
doi:10.1145/1653760.1653769 fatcat:npwsy3zyunfmje2ouqhhgx5nre
« Previous Showing results 1 — 15 out of 56 results