History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 | next | last

Result 1 to 20 of 26 total

Reducing depth in constrained PRFs: from bit-fixing to $\mathbf {NC}^{1}$. (English)
Cheng, Chen-Mou (ed.) et al., Public-key cryptography ‒ PKC 2016. 19th IACR international conference on practice and theory in public-key cryptography, Taipei, Taiwan, March 6‒9, 2016, Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-49386-1/pbk; 978-3-662-49387-8/ebook). Lecture Notes in Computer Science 9615, 359-385 (2016).
1
Information-theoretic local non-malleable codes and their applications. (English)
Kushilevitz, Eyal (ed.) et al., Theory of cryptography. 13th international conference, TCC 2016-A, Tel Aviv, Israel, January 10‒13, 2016. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-49098-3/pbk; 978-3-662-49099-0/ebook). Lecture Notes in Computer Science 9563, 367-392 (2016).
2
Block-Wise Non-Malleable Codes. (English)
ICALP, 31:1-31:14(2016)
3
Almost-everywhere secure computation with edge corruptions. (English)
J. Cryptology 28, No. 4, 745-768 (2015).
4
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults. (English)
ITCS, 153-162(2015)
5
Balancing output length and query bound in hardness preserving constructions of pseudorandom functions. (English)
Meier, Willi (ed.) et al., Progress in cryptology ‒ INDOCRYPT 2014. 15th international conference on cryptology in India, New Delhi, India, December 14‒17, 2014. Proceedings. Cham: Springer (ISBN 978-3-319-13038-5/pbk; 978-3-319-13039-2/ebook). Lecture Notes in Computer Science 8885, 89-103 (2014).
6
Privacy amplification with asymptotically optimal entropy loss. (English)
J. ACM 61, No. 5, Article No. 29, 28 p. (2014).
7
Position-based cryptography. (English)
SIAM J. Comput. 43, No. 4, 1291-1341 (2014).
8
Position-based quantum cryptography: impossibility and constructions. (English)
SIAM J. Comput. 43, No. 1, 150-178 (2014).
9
Achieving privacy in verifiable computation with multiple servers ‒ without FHE and without pre-processing. (English)
Krawczyk, Hugo (ed.), Public-key cryptography ‒ PKC 2014. 17th international conference on practice and theory in public-key cryptography, Buenos Aires, Argentina, March 26‒28, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54630-3/pbk). Lecture Notes in Computer Science 8383, 149-166 (2014).
10
Re-encryption, functional re-encryption, and multi-hop re-encryption: a framework for achieving obfuscation-based security and instantiations from lattices. (English)
Krawczyk, Hugo (ed.), Public-key cryptography ‒ PKC 2014. 17th international conference on practice and theory in public-key cryptography, Buenos Aires, Argentina, March 26‒28, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54630-3/pbk). Lecture Notes in Computer Science 8383, 95-112 (2014).
11
Locally updatable and locally decodable codes. (English)
Lindell, Yehuda (ed.), Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24‒26, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54241-1/pbk). Lecture Notes in Computer Science 8349, 489-514 (2014).
12
Privacy amplification with asymptotically optimal entropy loss. (English)
J. ACM 61, N0. 5, 29:1-29:28(2014)
13
Edge fault tolerance on sparse networks. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 452-463 (2012).
14
Functional re-encryption and collusion-resistant obfuscation. (English)
Cramer, Ronald (ed.), Theory of cryptography. 9th theory of cryptography conference, TCC 2012, Taormina, Sicily, Italy, March 19‒21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28913-2/pbk). Lecture Notes in Computer Science 7194, 404-421 (2012).
15
Position-based quantum cryptography: impossibility and constructions. (English)
Rogaway, Phillip (ed.), Advances in cryptology ‒ CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14‒18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22791-2/pbk). Lecture Notes in Computer Science 6841, 429-446 (2011).
16
Privacy amplification with asymptotically optimal entropy loss. (English)
Proceedings of the 42nd annual ACM symposium on theory of computing, STOC ’10. Cambridge, MA, USA, June 5‒8, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-817-9). 785-794 (2010).
17
Public-key encryption with efficient amortized updates. (English)
Garay, Juan A. (ed.) et al., Security and cryptography for networks. 7th international conference, SCN 2010, Amalfi, Italy, September 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15316-7/pbk). Lecture Notes in Computer Science 6280, 17-35 (2010).
18
Improved fault tolerance and secure computation on sparse networks. (English)
Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6‒10, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-14161-4/pbk). Lecture Notes in Computer Science 6199, 249-260 (2010).
19
Position based cryptography. (English)
Halevi, Shai (ed.), Advances in cryptology ‒ CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16‒20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03355-1/pbk). Lecture Notes in Computer Science 5677, 391-407 (2009).
20
first | previous | 1 21 | next | last

Result 1 to 20 of 26 total