Sciweavers

Share
7 search results - page 1 / 2
» tcc 2014
Sort
View
IACR
2016
46views Biometrics» more  IACR 2016»
3 years 7 months ago
On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography
Goldreich and Izsak (Theory of Computing, 2012) initiated the research on understanding the role of negations in circuits implementing cryptographic primitives, notably, consideri...
Douglas Miller, Adam Scrivener, Jesse Stern, Muthu...
TCC
2016
Springer
50views Cryptology» more  TCC 2016»
3 years 7 months ago
Rational Sumchecks
Rational proofs, introduced by Azar and Micali (STOC 2012) are a variant of interactive proofs in which the prover is neither honest nor malicious, but rather rational. The advanta...
Siyao Guo, Pavel Hubácek, Alon Rosen, Marga...
TCC
2016
Springer
44views Cryptology» more  TCC 2016»
3 years 7 months ago
Information-Theoretic Local Non-malleable Codes and Their Applications
Abstract. Error correcting codes, though powerful, are only applicable in scenarios where the adversarial channel does not introduce “too many” errors into the codewords. Yet, ...
Nishanth Chandran, Bhavana Kanukurthi, Srinivasan ...
ASIACRYPT
2015
Springer
3 years 7 months ago
On Cut-and-Choose Oblivious Transfer and Its Variants
Motivated by the recent progress in improving efficiency of secure computation, we study cut-and-choose oblivious transfer—a basic building block of state-of-the-art constant rou...
Vladimir Kolesnikov, Ranjit Kumaresan
IACR
2016
44views Biometrics» more  IACR 2016»
3 years 7 months ago
Strong Continuous Non-malleable Encoding Schemes with Tamper-Detection
Abstract—A non-malleable encoding scheme is a keyless encoding scheme which is resilient to tampering attacks. Such a scheme is said to be continuously secure if the scheme is re...
Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Dane...
books