Result 1 to 20 of 160 total
On the communication complexity of reliable and secure message transmission in asynchronous networks. (English)
Kim, Howon (ed.), Information security and cryptology ‒ ICISC 2011. 14th international conference, Seoul, Korea, November 30‒December 2, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31911-2/pbk). Lecture Notes in Computer Science 7259, 450-466 (2012).
1
Error-free multi-valued broadcast and Byzantine agreement with optimal communication complexity. (English)
Fernández Anta, Antonio (ed.) et al., Principles of distributed systems. 15th international conference, OPODIS 2011, Toulouse, France, December 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25872-5/pbk). Lecture Notes in Computer Science 7109, 34-49 (2011).
2
A methodology for generation of performance models for the sizing of analog high-level topologies. (English)
VLSI Des. 2011, Article ID 475952, 17 p. (2011).
3
Computational verifiable secret sharing revisited. (English)
Lee, Dong Hoon (ed.) et al., Advances in cryptology ‒ ASIACRYPT 2011. 17th international conference on the theory and application of cryptology and information security, Seoul, South Korea, December 4‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25384-3/pbk). Lecture Notes in Computer Science 7073, 590-609 (2011).
4
Secure message transmission in asynchronous networks. (English)
J. Parallel Distrib. Comput. 71, No. 8, 1067-1074 (2011).
5
Simple and efficient single round almost perfectly secure message transmission tolerating generalized adversary. (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, 292-308 (2011).
6
Communication optimal multi-valued asynchronous Byzantine agreement with optimal resilience. (English)
Fehr, Serge (ed.), Information theoretic security. 5th international conference, ICITS 2011, Amsterdam, The Netherlands, May 21‒24, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20727-3/pbk). Lecture Notes in Computer Science 6673, 206-226 (2011).
7
The round complexity of perfectly secure general VSS. (English)
Fehr, Serge (ed.), Information theoretic security. 5th international conference, ICITS 2011, Amsterdam, The Netherlands, May 21‒24, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20727-3/pbk). Lecture Notes in Computer Science 6673, 143-162 (2011).
8
A methodology for generation of performance models for the sizing of analog high-level topologies (English)
VLSI Design 2011 (2011).
9
Trimming process and temperature variation in second-order bandgap voltage reference circuits (English)
Microelectronics Journal 42, No. 2, 271-276 (2011).
10
On the communication complexity of reliable and secure message transmission in asynchronous networks (English)
IACR Cryptology ePrint Archive 2011, 288 (2011).
11
Leakage resilient secure two-party computation (English)
IACR Cryptology ePrint Archive 2011, 256 (2011).
12
Statistical asynchronous weak commitment scheme: A new primitive to design statistical asynchronous verifiable secret sharing scheme (English)
IACR Cryptology ePrint Archive 2011, 31 (2011).
13
Simple and efficient single round almost perfectly secure message transmission tolerating generalized adversary (English)
IACR Cryptology ePrint Archive 2011, 27 (2011).
14
Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity (English)
IACR Cryptology ePrint Archive 2011, 313 (2011).
15
Does pseudo-basis extend to general adversary? (English)
IACR Cryptology ePrint Archive 2011, 82 (2011).
16
Computational verifiable secret sharing revisited (English)
IACR Cryptology ePrint Archive 2011, 281 (2011).
17
Non-applicability of pseudobasis for designing perfectly secure message transmission protocols against non-threshold adversary (English)
IACR Cryptology ePrint Archive 2011, 54 (2011).
18
Achieving monotonic variation of spectral composition in DC-DC converters using pulse skipping modulation (English)
IEEE Trans. on Circuits and Systems 58-I, No. 8, 1958-1966 (2011).
19
The round complexity of perfectly secure general VSS (English)
ICITS, 143-162 (2011).
20
Result 1 to 20 of 160 total
Start
Contact
Print
General Help
