搜索结果: 1-15 共查到“Indistinguishability”相关记录83条 . 查询时间(0.062 秒)
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification
PFG iO
2019/6/4
The existence of secure indistinguishability obfuscators (iO) has far-reaching implications, significantly expanding the scope of problems amenable to cryptographic study. All known approaches to cons...
On the Streaming Indistinguishability of a Random Permutation and a Random Function
Streaming algorithm time-memory tradeoff switching lemma
2019/4/23
An adversary with SS bits of memory obtains a stream of QQ elements that are uniformly drawn from the set {1,2,…,N}{1,2,…,N}, either with or without replacement. This corresponds to sampling QQ elemen...
Quantum Indistinguishability of Random Sponges
Symmetric cryptography keyed sponges indistinguishability
2019/1/26
In this work we show that the sponge construction can be used to construct quantum-secure pseudorandom functions. As our main result we prove that random sponges are quantum indistinguishable from ran...
Candidate Differing-Inputs Obfuscation from Indistinguishability Obfuscation and Auxiliary-Input Point Obfuscation
Indistinguishability Obfuscation Auxiliary-Input Point Obfuscation
2018/11/2
Differing-inputs obfuscation (diO), first proposed by Barak et. al. [4], provides stronger security than that provided by indistinguishability obfuscation (iO). An iO scheme provides indistinguishabil...
Pseudo Flawed-Smudging Generators and Their Application to Indistinguishability Obfuscation
indistinguishability obfuscation functional encryption pseudo-randomness
2018/7/9
We construct indistinguishability obfuscation from subexponentially secure Learning With Errors (LWE), bilinear maps, a constant-locality Pseudo Random Generator (PRG), and a new tool called Pseudo Fl...
New Methods for Indistinguishability Obfuscation: Bootstrapping and Instantiation
indistinguishability obfuscation functional encryption bootstrapping
2018/6/27
In a recent work, Lin and Tessaro [LT17] (LT) show that iO may be constructed using i) Functional Encryption (FE) for polynomials of degree LL , ii) Pseudorandom Generators (PRG) with blockwise locali...
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness
Indistinguishability Obfuscation Functional Encryption
2018/6/25
The existence of secure indistinguishability obfuscators (iO) has far-reaching implications, significantly expanding the scope of problems amenable to cryptographic study. All known approaches to cons...
Simplifying Game-Based Definitions: Indistinguishability up to Correctness and Its Application to Stateful AE
indistinguishability oracle silencing provable security
2018/6/5
Often the simplest way of specifying game-based cryptographic definitions is apparently barred because the adversary would have some trivial win. Disallowing or invalidating these wins can lead to com...
Statistical Witness Indistinguishability (and more) in Two Messages
statistical witness indistinguishability super-polynomial simulation statistical ZK ompressing interactive arguments
2018/3/6
Two-message witness indistinguishable protocols were first constructed by Dwork and Naor (FOCS 00). They have since proven extremely useful in the design of several cryptographic primitives. However, ...
Evaluating the indistinguishability of the XTS mode in the proposed security model
block cipher XTS indistinguishability
2018/2/3
In this paper, we consider the indistinguishability of XTS in some security models for both full final block and partial final block cases. Firstly, some evaluations of the indistinguishability up-to-...
Recently, Albrecht, Davidson, Larraia, and Pellet-Mary constructed a variant of the GGH13 without ideals and presented the distinguishing attacks in simplified branching program and obfuscation securi...
Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation
Signature scheme indistinguishability obfuscation puncturable pseudo-random functions
2017/10/9
Indistinguishability obfuscation (iO) is a powerful cryptographic tool often employed to construct a variety of core cryptographic primitives such as public key encryption and signatures. In this pape...
Information-theoretic Indistinguishability via the Chi-squared Method
Symmetric cryptography information-theoretic indistinguishability provable security
2017/6/9
Proving tight bounds on information-theoretic indistinguishability is a central problem in symmetric cryptography. This paper introduces a new method for information-theoretic indistinguishability pro...
Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability
mix-nets witness indistinguishability Benes network
2017/6/9
We show that the simple and appealing unconditionally sound mix-net due to Abe (Asiacrypt'99) can be augmented to further guarantee anonymity against malicious verifiers. This additional guarantee imp...
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions
Zero knowledge Witness indistinguishability Super-polynomial simulation
2017/5/23
We study the feasibility of two-message protocols for secure two-party computation in the plain model, for functionalities that deliver output to one party, with security against malicious parties. Si...