Sciweavers

570 search results - page 57 / 114
» Black-box constructions for secure computation
Sort
View
ACISP
2006
Springer
13 years 11 months ago
Online/Offline Signatures and Multisignatures for AODV and DSR Routing Security
Efficient authentication is one of important security requirements in mobile ad hoc network (MANET) routing systems. The techniques of digital signatures are generally considered a...
Shidi Xu, Yi Mu, Willy Susilo
ASIACRYPT
2004
Springer
14 years 1 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
ASIACRYPT
2010
Springer
13 years 6 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
Jens Groth
PODC
2003
ACM
14 years 1 months ago
Oblivious signature-based envelope
We propose a new cryptographic primitive called oblivious signaturebased envelope (OSBE). Informally, an OSBE scheme enables a sender to send an envelope (encrypted message) to a ...
Ninghui Li, Wenliang Du, Dan Boneh
PET
2007
Springer
14 years 2 months ago
Pairing-Based Onion Routing
Abstract. This paper presents a novel use of pairing-based cryptography to improve circuit construction in onion routing anonymity networks. Instead of iteratively and interactivel...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg