Result 1 to 20 of 84 total
Tamper and leakage resilience in the split-state model. (English)
Safavi-Naini, Reihaneh (ed.) et al., Advances in cryptology ‒ CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19‒23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32008-8/pbk). Lecture Notes in Computer Science 7417, 517-532 (2012).
1
Malleable proof systems and applications. (English)
Pointcheval, David (ed.) et al., Advances in cryptology ‒ EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15‒19, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29010-7/pbk). Lecture Notes in Computer Science 7237, 281-300 (2012).
2
Usable optimistic fair exchange. (English)
Comput. Netw. 56, No. 1, 50-63 (2012).
3
Optimistic fair exchange with multiple arbiters. (English)
Gritzalis, Dimitris (ed.) et al., Computer security ‒ ESORICS 2010. 15th European symposium on research in computer security, Athens, Greece, September 20‒22, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15496-6/pbk). Lecture Notes in Computer Science 6345, 488-507 (2010).
4
Algorithmic tamper-proof security under probing attacks. (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, 106-120 (2010).
5
Authenticated error-correcting codes with applications to multicast authentication. (English)
ACM Trans. Inf. Syst. Secur. 13, No. 2 (2010).
6
Usable optimistic fair exchange. (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, 252-267 (2010).
7
Rational secret sharing with side information in point-to-point networks via time-delayed encryption (English)
IACR Cryptology ePrint Archive 2010, 540 (2010).
8
Algorithmic tamper-proof security under probing attacks (English)
SCN, 106-120 (2010).
9
Usable optimistic fair exchange (English)
CT-RSA, 252-267 (2010).
10
ZKPDL: A language-based system for efficient zero-knowledge proofs and electronic cash (English)
USENIX Security Symposium, 193-206 (2010).
11
Optimistic fair exchange with multiple arbiters (English)
ESORICS, 488-507 (2010).
12
Randomizable proofs and delegatable anonymous credentials. (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, 108-125 (2009).
13
Compact e-cash and simulatable VRFs revisited. (English)
Shacham, Hovav (ed.) et al., Pairing-based cryptography ‒ Pairing 2009. Third international conference Palo Alto, CA, USA, August 12‒14, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03297-4/pbk). Lecture Notes in Computer Science 5671, 114-131 (2009).
14
Forward-secure hierarchical IBE with applications to broadcast encryption. (English)
Joye, Marc (ed.) et al., Identity-based cryptography. Amsterdam: IOP Press (ISBN 978-1-58603-947-9/hbk). Cryptology and Information Security Series 2, 100-118 (2009).
15
Compact E-cash and simulatable vrfs revisited (English)
IACR Cryptology ePrint Archive 2009, 107 (2009).
16
Optimistic fair exchange with multiple arbiters (English)
IACR Cryptology ePrint Archive 2009, 69 (2009).
17
Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters (English)
PODC, 336-337 (2009).
18
Randomizable proofs and delegatable anonymous credentials (English)
CRYPTO, 108-125 (2009).
19
Compact E-cash and simulatable vrfs revisited (English)
Pairing, 114-131 (2009).
20
Result 1 to 20 of 84 total
Start
Contact
Print
General Help
