284 Hits in 3.9 sec

Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms [chapter]

Sourav Mukhopadhyay, Palash Sarkar
2006 Lecture Notes in Computer Science  
We consider the problem of efficiently generating sequences in hardware for use in certain cryptographic algorithms. The conventional method of doing this is to use a counter.  ...  As a result, we are able to suggest improvements to the design of DES Cracker built by the Electronic Frontier Foundation in 1998; provide an efficient strategy for generating start points in time-memory  ...  The computer stops the chip; resets the key counter; puts a new value in the top 24 bits; and the search starts once more with this new 24-bit value.  ... 
doi:10.1007/11751595_47 fatcat:btdk3oob2jehpmuvkrptpomtnq

Conjecturally Superpolynomial Lower Bound for Share Size [article]

Shahram Khazaei
2018 IACR Cryptology ePrint Archive  
The best known lower bound, due to Csirmaz (1994), is Ωpn{ log nq. Closing this gap is a long-standing open problem in cryptology.  ...  It is generally believed that there exists a family of access structures such that the information ratio of any secret sharing scheme realizing it is 2 Ωpnq , where the parameter n stands for the number  ...  The proof of Lemma 11 is due to Morteza Fotouhi.  ... 
dblp:journals/iacr/Khazaei18 fatcat:vhsob2fq75ctxoaxj2aybmnv6u

8. Scenes of secrecy [chapter]

2018 Real Life Cryptology  
Faking is concealing the real thought, emotion or intention in such a way that makes even the act of faking secret and unknown.  ...  In grand-scale politics the raison d'état was the cause for the diverse usage of dissimulation as the absolutist states were being established.  ...  to apply ciphers in political communication is indicated by a number of sources where 'clavis' and 'secret' are mentioned in the same sentence, or where a secret is said to be only shared with a cipher  ... 
doi:10.1515/9789048536696-011 fatcat:iktifykhubcftly4hriq2fgxga

5. Ciphers in Hungary: the source material [chapter]

2018 Real Life Cryptology  
But what does "the early modern Hungarian source material" refer to precisely? Where are the frontiers of Hungary, and where are the limits of the early modern period?  ...  of a new source.  ... 
doi:10.1515/9789048536696-008 fatcat:dtym7ri2ijgurofe2labendsom

Lattice-Face Key Infrastructure (LFKI) for Quantum Resistant Computing [article]

Josiah Johnson Umezurike
2019 IACR Cryptology ePrint Archive  
A new light is shown by exploring a hybrid system designed to exhibit symmetric and asymmetric properties.  ...  It is nearly enough to facilitate and establish lattice basis; an exception from the priori art [1] .  ...  We plan to continue the research work to promote and share this new direction with you all. VOLUME 4, 2016  ... 
dblp:journals/iacr/Umezurike19 fatcat:zrcpeily6ndfhcth22d6os7fka

A Candidate Access Structure for Super-polynomial Lower Bound on Information Ratio [article]

Shahram Khazaei
2019 IACR Cryptology ePrint Archive  
The best known lower bound, due to Csirmaz (1994), is Ωpn{ log nq. Closing this gap is a long-standing open problem in cryptology.  ...  It is generally believed that there exists a family of access structures such that the information ratio of any secret sharing scheme realizing it is 2 Ωpnq , where the parameter n stands for the number  ...  I also thank Morteza Fotouhi for the proof of Lemma 5.9 and Carles Padró for the useful discussions.  ... 
dblp:journals/iacr/Khazaei19 fatcat:bfxk4nsebvbobiyeqs7shfbv5i

Visualizing size-security tradeoffs for lattice-based encryption [article]

Daniel J. Bernstein
2019 IACR Cryptology ePrint Archive  
Part of the problem is with the underlying data points, and part of the problem is with how the data points are converted into graphs.  ...  How do these systems compare in the security that they provide against known attacks, under various limits on communication volume?  ...  A reasonable answer is to draw another graph for this application, where the horizontal axis is ciphertext size plus 1 megabyte.  ... 
dblp:journals/iacr/Bernstein19 fatcat:o2vezfbrlvdqvm2gtkobqfmlpa

On the Cost of Adaptivity in Graph-Based Games [article]

Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter
2021 IACR Cryptology ePrint Archive  
Our main conceptual contribution is a two-player multi-stage game called the Builder-Pebbler Game.  ...  The security of cryptographic primitives and protocols against adversaries that are allowed to make adaptive choices (e.g., which parties to corrupt or which queries to make) is notoriously difficult to  ...  . 2) In case the adversary is not too restricted (which is application dependent), there is a generic fix where the adversary abuses the encrypt oracle to achieve this fingerprinting by introducing a new  ... 
dblp:journals/iacr/KamathKPW21 fatcat:chk7amsogjbk5lhr2jind3zdli

Zero-Knowledge Middleboxes [article]

Paul Grubbs, Arasu Arun, Ye Zhang, Joseph Bonneau, Michael Walfish
2021 IACR Cryptology ePrint Archive  
In such configurations, the middlebox's overhead is 2-5 ms of running time per proof, and client latency to create a proof is several seconds.  ...  Clients send the middlebox zero-knowledge proofs that their traffic is policy-compliant; these proofs reveal nothing about the client's communication except that it complies with the policy.  ...  Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the United States Government or DARPA.  ... 
dblp:journals/iacr/GrubbsAZBW21 fatcat:b3g2fbyk5zav3hvlaqnanutcom

Structured Module Learning With Errors From Cyclic Algebras [article]

Charles Grover, Cong Ling
2019 IACR Cryptology ePrint Archive  
The proposed construction is both more efficient than Module LWE and conjecturally more secure than Ring LWE, the best of both worlds.  ...  The Learning with Errors (LWE) problem is the fundamental backbone of modern lattice based cryptography, allowing one to establish cryptography on the hardness of well-studied computational problems.  ...  Acknowledgment The authors would like to thank Jyrki Lahtonen, Damien Stehle and Martin Albrecht for helpful discussions.  ... 
dblp:journals/iacr/GroverL19 fatcat:p3dgsphajjed3d4tb6xumv4xry

Hydra: Fast Isomorphic State Channels [article]

Manuel M. T. Chakravarty, Sandro Coretti, Matthias Fitzi, Peter Gazi, Philipp Kant, Aggelos Kiayias, Alexander Russell
2020 IACR Cryptology ePrint Archive  
In the case of disputes, or if a party fails to respond, cryptographic evidence collected in the offchain channel is used to settle the last confirmed state onchain, such that in-progress contracts can  ...  A serious disadvantage present in current layer-two state channel protocols is that existing layer-one smart contract infrastructure and contract code cannot be reused offchain without change.  ...  We want to thank Duncan Coutts and Neil Davies for advice on technical aspects of the simulations, and Neil Davies for providing the measurements of round trip times between different AWS regions.  ... 
dblp:journals/iacr/ChakravartyCFGK20 fatcat:prfygzlfa5bivbi3ofsuchqo2i

Secure MPC: Laziness Leads to GOD [article]

Saikrishna Badrinarayanan, Aayush Jain, Nathan Manohar, Amit Sahai
2018 IACR Cryptology ePrint Archive  
In order to solve this problem, we introduce a new notion of multi-key FHE designed to handle arbitrary access patterns that can reconstruct the output.  ...  However, this definition of MFHE works only for n-out-of-n access structures and, thus, each node in the system is a point of failure.  ...  This material is based upon work supported by the Defense Advanced Research Projects Agency through Award HR00112020024 and the ARL under Contract W911NF-15-C-0205.  ... 
dblp:journals/iacr/BadrinarayananJ18 fatcat:72ojpxcpundu3ejdqx2palvrby

Secure Non-interactive Simulation: Hardness & Feasibility [article]

Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen
2020 IACR Cryptology ePrint Archive  
The authors believe that specifically developing new general analysis methodologies respecting security is of independent and broader interest.  ...  The technical results rely on a new concentration of the Fourier spectrum unique to secure constructions.  ...  Consequently, the next logical frontier is the characterization of rate/capacity of general secure computation. Remark 4. Observe that independent coin samples are equivalent to BSS(1/2) samples.  ... 
dblp:journals/iacr/KhorasganiMN20 fatcat:rzi2hwh5mrbl5am6o24yjvlkfy

AdVeil: A Private Targeted-Advertising Ecosystem [article]

Sacha Servan-Schreiber, Kyle Hogan, Srinivas Devadas
2021 IACR Cryptology ePrint Archive  
AdVeil is built around an untrusted advertising network which is responsible for brokering the display of advertisement to users.  ...  This is done without the ad network learning which user interacted with an ad, only that some honest user did.  ...  (where the client's identity is hidden by the anonymizing proxy).  ... 
dblp:journals/iacr/Servan-Schreiber21 fatcat:7v3prq5awfh6tjtxarnwmxlq6m

Black-Box Non-Interactive Non-Malleable Commitments [article]

Rachit Garg, Dakshita Khurana, George Lu, Brent Waters
2020 IACR Cryptology ePrint Archive  
Our key technical contribution is a novel way of implementing the non-interactive proof of consistency required by the tag amplification process.  ...  Prior to our work, the only known approach to tag amplification without setup and with black-box use of the base scheme (Goyal, Lee, Ostrovsky and Visconti, FOCS 2012) added multiple rounds of interaction  ...  In other words, we would like to establish a system where the adversary cannot submit a commitment such that its opening will be different under the original and new oracle functions.  ... 
dblp:journals/iacr/GargKLW20 fatcat:v7mg7z7dorf43obczvvamoalgi
« Previous Showing results 1 — 15 out of 284 results