Sciweavers

588 search results - page 30 / 118
» Reducibility and Completeness in Private Computations
Sort
View
COMCOM
2004
85views more  COMCOM 2004»
15 years 6 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
JCSS
1998
74views more  JCSS 1998»
15 years 5 months ago
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
Manindra Agrawal, Eric Allender, Steven Rudich
IACR
2011
135views more  IACR 2011»
14 years 5 months ago
An Improved Internet Voting Protocol
Norway is going to experience an Internet voting scheme in September 2011 for local governmental elections, targeting a comprehensive Internet voting system in 2017 for national el...
Mehmet Sabir Kiraz, Süleyman Kardas, Muhammed...
INFOCOM
2009
IEEE
16 years 22 days ago
Multi-VPN Optimization for Scalable Routing via Relaying
—Enterprise networks are increasingly adopting Layer 3 Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) technology to connect geographically disparate locations...
MohammadHossein Bateni, Alexandre Gerber, Mohammad...
CNSR
2004
IEEE
153views Communications» more  CNSR 2004»
15 years 9 months ago
An Authenticated Broadcasting Scheme for Wireless Ad Hoc Network
In this paper, we propose a pairing-based signcryption scheme for authenticated broadcasting, which requires less computation than a previously proposed scheme suggesting identity...
Muhammad J. Bohio, Ali Miri