Result 1 to 20 of 154 total
Computational extractors and pseudorandomness. (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, 383-403 (2012).
1
On clustering {\sc Dag}s for task-hungry computing platforms. (English)
Cent. Eur. J. Comput. Sci. 1, No. 1, 19-35 (2011).
2
Verifiable delegation of computation over large datasets. (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, 111-131 (2011).
3
Fully non-interactive onion routing with forward-secrecy. (English)
Lopez, Javier (ed.) et al., Applied cryptography and network security. 9th international conference, ACNS 2011, Nerja, Spain, June 7‒10, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21553-7/pbk). Lecture Notes in Computer Science 6715, 255-273 (2011).
4
Public key cryptography ‒ PKC 2011. 14th international conference on practice and theory in public key cryptography, Taormina, Italy, March 6‒9, 2011. Proceedings. (English)
Lecture Notes in Computer Science 6571. Berlin: Springer (ISBN 978-3-642-19378-1/pbk). xiii, 495~p. EUR~74.90 (2011).
5
On clustering dags for task-hungry computing platforms (English)
Central Europ. J. Computer Science 1, No. 1, 19-35 (2011).
6
Verifiable delegation of computation over large datasets (English)
IACR Cryptology ePrint Archive 2011, 132 (2011).
7
Verifiable delegation of computation over large datasets (English)
CRYPTO, 111-131 (2011).
8
Fully non-interactive onion routing with forward-secrecy (English)
ACNS, 255-273 (2011).
9
Identity-based key exchange protocols without pairings. (English)
Gavrilova, Marina L. (ed.) et al., Transactions on Computational Science X. Special issue on security in computing, Part I. Berlin: Springer (ISBN 978-3-642-17498-8/pbk). Lecture Notes in Computer Science 6340. Journal Subline, 42-77 (2010).
10
Constructing certificateless encryption and ID-based encryption from ID-based key agreement. (English)
Joye, Marc (ed.) et al., Pairing-based cryptography ‒ Pairing 2010. 4th international conference, Yamanaka Hot Spring, Japan, December 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17454-4/pbk). Lecture Notes in Computer Science 6487, 167-186 (2010).
11
Area-maximizing schedules for series-parallel dags. (English)
D’Ambra, Pasqua (ed.) et al., Euro-Par 2010 ‒ parallel processing. 16th international Euro-Par conference, Ischia, Italy, August 31 ‒ September 3, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-15290-0/pbk). Lecture Notes in Computer Science 6272, 380-392 (2010).
12
Non-interactive verifiable computing: Outsourcing computation to untrusted workers. (English)
Rabin, Tal (ed.), Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14622-0/pbk). Lecture Notes in Computer Science 6223, 465-482 (2010).
13
Okamoto-Tanaka revisited: Fully authenticated Diffie-Hellman with minimal overhead. (English)
Zhou, Jianying (ed.) et al., Applied cryptography and network security. 8th international conference, ACNS 2010, Beijing, China, June 22‒25, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13707-5/pbk). Lecture Notes in Computer Science 6123, 309-328 (2010).
14
Text search protocols with simulation based security. (English)
Nguyen, Phong Q. (ed.) et al., Public key cryptography ‒ PKC 2010. 13th international conference on practice and theory in public key cryptography, Paris, France, May 26‒28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13012-0/pbk). Lecture Notes in Computer Science 6056, 332-350 (2010).
15
Secure network coding over the integers. (English)
Nguyen, Phong Q. (ed.) et al., Public key cryptography ‒ PKC 2010. 13th international conference on practice and theory in public key cryptography, Paris, France, May 26‒28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13012-0/pbk). Lecture Notes in Computer Science 6056, 142-160 (2010).
16
Making the Diffie-Hellman protocol identity-based. (English)
Pieprzyk, Josef (ed.), Topics in cryptology ‒ CT-RSA 2010. The cryptographers’ track at the RSA conference 2010, San Francisco, CA, USA, March 1‒5, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11924-8/pbk). Lecture Notes in Computer Science 5985, 165-178 (2010).
17
A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack. (English)
J. Cryptology 23, No. 1, 91-120 (2010).
18
Identity-based key exchange protocols without pairings (English)
Transactions on Computational Science 10, 42-77 (2010).
19
Okamoto-tanaka revisited: fully authenticated diffie-hellman with minimal overhead (English)
IACR Cryptology ePrint Archive 2010, 68 (2010).
20
Result 1 to 20 of 154 total
Start
Contact
Print
General Help
